25982

Appears in sequences

• a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026681.at n=12A026690
• Number of partitions of n into parts not of the form 21k, 21k+8 or 21k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=39A035986
• Triangle T(n,k) read by rows: T(n,k) = (n-k+1)*T(n-1,k-1) + (3*k-2)*k*T(n-1,k), initialized by T(n,1) = T(n,n) = 1.at n=17A166972
• Triangle T(n,k) = binomial(n,k) + A176490(n,k) - 1 read along rows 0<=k<=n.at n=24A176491
• p-INVERT of the positive integers, where p(S) = 1 - S - S^2 - S^3 + S^4.at n=8A291032