20936
domain: N
Appears in sequences
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.at n=35A073151
- Number of (n+1)X(1+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14.at n=3A233646
- Number of (n+1)X(4+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14.at n=0A233649
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=6A233653
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=9A233653
- Numbers that are the sum of seven fifth powers in two or more ways.at n=22A345605
- Numbers that are the sum of seven fifth powers in exactly two ways.at n=22A346279
- Number of non-subset-sums of strict integer partitions of n.at n=40A365922
- G.f. satisfies A(x) = ( 1 + x * (A(x)^(1/2) / (1-x))^2 )^2.at n=7A370479
- Sum of the orders of the automorphism groups for every group of order n.at n=15A385480
- Array read by downward antidiagonals: A(n,k) = A(n-1,k) + (k+1)*A(n-1,k+1) + k*A(n-1,k-1) with A(n,0) = A(n-1,0) + A(n-1,1), A(0,k) = 1.at n=33A391886