36825
domain: N
Appears in sequences
- a(n) = Sum_{i+j+k=n, i,j,k >= 1} tau(i)*tau(j)*tau(k), where tau() = A000005().at n=43A191829
- Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 2 3 4 5 or 6.at n=3A251383
- Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6.at n=0A251386
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6.at n=6A251390
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6.at n=9A251390
- Number of partitions of n whose greatest part is a multiple of 4.at n=48A363046
- a(n) = (1/7) * Sum_{k=0..n-1} binomial(7*n,7*k+1).at n=3A387748