329931

Appears in sequences

• Odd partition numbers.at n=30A052003
• Number of ways to partition 2n+1 into positive integers.at n=26A058695
• a(n) = p(P(n)), P = primes (A000040), p = partition numbers (A000041).at n=15A058698
• Partition numbers of the form 3*k.at n=24A087183
• a(n) is the number of partitions of n into parts not greater than A020639(n).at n=52A097359
• Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=34A111329
• 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=21A111451
• 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=15A111515
• Odd partition numbers of odd numbers.at n=16A154795
• Odd partition numbers of prime numbers.at n=10A193831
• Partition numbers p(n) having the same parity as n.at n=28A209658
• Partition numbers of the form 7k.at n=18A225327
• Partition numbers of the form 9k.at n=7A225360
• 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=53A233810
• Sum of the partition number of the prime factors of n with multiplicity.at n=52A342621
• If n = Product (p_j^k_j) then a(n) = Product partition(p_j^k_j).at n=52A381013
• If n = Product (p_j^k_j) then a(n) = Sum partition(p_j^k_j).at n=52A381014
• Number of ways to choose a sequence of distinct integer partitions, one of each prime factor of n (with multiplicity).at n=52A387133
• Number of ways to choose an integer partition of each prime factor of n (with multiplicity).at n=52A387327