63261
domain: N
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=43A000041
- Expansion of g.f. 1/((1-9*x)*(1-12*x)).at n=4A016191
- Earliest sequence where a(a(n))=number of partitions of n.at n=44A038752
- Nonprime partition numbers.at n=35A038753
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=43A039896
- Odd partition numbers.at n=24A052003
- Number of ways to partition 2n+1 into positive integers.at n=21A058695
- a(n) = p(P(n)), P = primes (A000040), p = partition numbers (A000041).at n=13A058698
- Number of partitions of n with at least one odd part.at n=43A086543
- Partition numbers of the form 3*k.at n=19A087183
- Smallest partition number with n-th prime as factor.at n=19A091689
- a(n) is the number of partitions of n into parts not greater than A020639(n).at n=42A097359
- Number of partitions of n into integers not greater than the squarefree kernel of n.at n=42A098715
- Expansion of (3*x+1)/(1-3*x-3*x^2).at n=8A108306
- Number of partitions of 3n+1.at n=14A111295
- Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=13A111329
- Number of partitions of (6*n + 1).at n=7A111370
- 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=17A111451
- Number of partitions of T where T=(7*n + 1) if n is even and T=((7*n + 1)/2) if n is odd.at n=6A111515
- 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=30A117751