89134

Appears in sequences

• a(n) is the number of partitions of n (the partition numbers).at n=45A000041
• Earliest sequence where a(a(n))=number of partitions of n.at n=46A038752
• Nonprime partition numbers.at n=37A038753
• Even partition numbers.at n=18A052001
• Number of ways to partition 2n+1 into positive integers.at n=22A058695
• Number of partitions of n*(n-1)/2.at n=9A066655
• Number of partitions of n with at least one odd part.at n=45A086543
• Partition numbers of the form 3*k+1.at n=13A087184
• T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.at n=57A090011
• Largest partition number not exceeding 10^n.at n=4A097983
• Even partition numbers of odd numbers.at n=8A154796
• Partition numbers p(n) having opposite parity of n.at n=21A209659
• Number of partitions of n in which no parts are multiples of 49.at n=45A213598
• Number of starting configurations of Nim with n pieces such that 1st player wins. Partitions of n such that their xor-sum is nonzero.at n=45A233810
• Partition numbers (A000041) congruent to 2 (mod 4).at n=13A275029
• Product_{n>=1} (1 + x^n)^a(n) = g.f. of A001970 (partitions of partitions).at n=44A305841
• Number of integer partitions of n without a nonempty initial consecutive subsequence summing to n/2.at n=45A362558
• Expansion of Sum_{n>=1} x^(n^2)*((1+x)/(1-x))^n.at n=38A369424
• Number of non-biquanimous integer partitions of n.at n=45A371795