61006
domain: N
Appears in sequences
- Numbers whose square can be written as sum of at least 3 consecutive triangular numbers in two ways.at n=9A256000
- Number of 3 X n 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=15A281207
- Number of multiset partitions of multiset partitions of strongly normal multisets of size n.at n=6A318565
- a(n) = 1 + Sum_{k=0..n-1} (1 + k^5) * a(k) * a(n-1-k).at n=4A385838
- a(n) = Sum_{k=0..n} 3^k * 2^(n-k) * binomial(2*n+1,k) * binomial(2*n-k,n-k).at n=4A386829