22864

Appears in sequences

• Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=50A035538
• Number of ordered partitions of partitions.at n=11A055887
• a(n) = 4^n mod n^4.at n=13A066608
• Expansion of Product_{m>=1} 1/(1-x^m)^A000009(m).at n=21A089259
• Triangular array read by rows: T(n,k) is the number of ordered set partitions of {1,2,...,n} with exactly k singletons, n>=0, 0<=k<=n.at n=37A187784
• Number of compositions of n with difference 3 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=13A242843
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 5", based on the 5-celled von Neumann neighborhood.at n=31A270008
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 5", based on the 5-celled von Neumann neighborhood.at n=32A270008
• Alternating sum of centered octagonal pyramidal numbers.at n=32A270695
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=31A271062
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 469", based on the 5-celled von Neumann neighborhood.at n=31A272418
• G.f.: Sum_{k>0} x^prime(k)/(1-x)^k.at n=26A278800
• a(n) = tau(n)^n mod n^tau(n).at n=13A302976
• Numbers that cannot be expressed as the sum of one or more numbers without any repeated digits.at n=34A342080
• G.f. A(x) satisfies: A(x) = A(x^2 + x^3) / x.at n=25A350432
• Total number of parts coprime to n in the partitions of n into 10 parts.at n=38A363328
• The smallest term in A061862 with exactly n distinct partitions into a sum of nonnegative powers of its digits.at n=5A388297