56970
domain: N
Appears in sequences
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x10^2 = n.at n=29A045852
- a(n) = (2*n-1)*(5*n^2-5*n+2)/2.at n=22A063495
- Number of binary strings with n 1's and n 0's avoiding zigzags, that is avoiding the substrings 101 and 010.at n=13A078678
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.at n=39A085844
- Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=4A206754
- Number of (n+1)X6 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=0A206758
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=10A206761
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=14A206761
- Sum of the middle parts in the partitions of 4n-1 into 3 parts.at n=33A240707
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x^2.at n=50A368150