21008

Appears in sequences

• Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=34A028660
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having three, four or five distinct values for every i,j,k<=n.at n=12A211724
• Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 7).at n=14A250263
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 401", based on the 5-celled von Neumann neighborhood.at n=31A271805
• Number of strictly recursively normal integer partitions of n.at n=43A330937
• Expansion of (1/x) * Series_Reversion( x * (1+x)^3 / (1+x+x^2)^4 ).at n=8A372383
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly 2 ways, or -1 if no such number exists.at n=38A374287
• Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = n^2 x and t(x) = x+2. See Comments.at n=22A375043