21310
domain: N
Appears in sequences
- G.f. A(x) satisfies: A(x)^2 equals the g.f. of A110637, which consists entirely of numbers 1 through 8.at n=21A112571
- Number of strings of numbers x(i=1..n) in 0..5 with sum i*x(i) equal to n*5.at n=9A184699
- Number of strings of numbers x(i=1..10) in 0..n with Sum_{i=1..10} i*x(i) = n*10.at n=4A184710
- Number of strict partitions of 2n having an ordering of the parts in which no two neighboring parts have the same parity.at n=37A239882
- Number of compositions of n if only the order of the even numbers matter.at n=27A275592
- a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/(2*k-1))^3.at n=27A350163