44583

Appears in sequences

• a(n) is the number of partitions of n (the partition numbers).at n=41A000041
• Incorrect version of A107357.at n=40A037181
• Nonprime partition numbers.at n=33A038753
• Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=41A039896
• a(n) is the n-th term in sequence A_n, respecting the offset, or a(n) = -1 if A_n has fewer than n terms.at n=40A051070
• Odd partition numbers.at n=23A052003
• Number of ways to partition 2n+1 into positive integers.at n=20A058695
• a(n) = p(P(n)), P = primes (A000040), p = partition numbers (A000041).at n=12A058698
• Number of partitions of n with at least one odd part.at n=41A086543
• Partition numbers of the form 3*k.at n=18A087183
• a(n) is the number of partitions of n into parts not greater than A020639(n).at n=40A097359
• Number of partitions of n into integers not greater than the squarefree kernel of n.at n=40A098715
• Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=26A111329
• Number of partitions of P where P=(5*n + 1) if n is even and P=((5*n + 1)/2) if n is odd.at n=8A111451
• Irregular triangle with those partition numbers A000041( n*(2*m-1)+m+2 ) in row n which are congruent to 0 (mod 2m-1), m=1..n.at n=7A117751
• G.f.: A(x) = 1/(1 - x*B(x^2)), where B(x) = Sum_{n>=0} a(n)^2*x^n is the g.f. of A121648.at n=20A121649
• A bisection of A121649; a(n) = A121649(2*n) = A121648(2*n)^(1/2).at n=10A121650
• Number of indecomposable partitions of n.at n=40A122697
• a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).at n=40A141670
• Odd partition numbers of odd numbers.at n=12A154795