21637
domain: N
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=37A000041
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=40A025004
- Nonprime partition numbers.at n=29A038753
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=37A039896
- Numbers k such that 201*2^k-1 is prime.at n=40A050852
- Odd partition numbers.at n=20A052003
- Number of ways to partition 2n+1 into positive integers.at n=18A058695
- a(n) = p(P(n)), P = primes (A000040), p = partition numbers (A000041).at n=11A058698
- Numbers k such that sigma(k+1) = 2*phi(k).at n=12A067260
- Number of partitions of n with at least one odd part.at n=37A086543
- Partition numbers of the form 3*k+1.at n=11A087184
- a(n) is the number of partitions of n into parts not greater than A020639(n).at n=36A097359
- Number of partitions of n into integers not greater than the squarefree kernel of n.at n=36A098715
- Number of partitions of 3n+1.at n=12A111295
- Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=11A111329
- Number of partitions of (6*n + 1).at n=6A111370
- Number of indecomposable partitions of n.at n=36A122697
- a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).at n=36A141670
- Odd partition numbers of odd numbers.at n=10A154795
- Numbers k such that 3 + 10^k + 3*100^k is prime.at n=14A171149