31185

Appears in sequences

• a(n) is the number of partitions of n (the partition numbers).at n=39A000041
• Nonprime partition numbers.at n=31A038753
• Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=39A039896
• Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=33A046320
• Odd partition numbers.at n=22A052003
• Highly composite odd numbers: odd numbers where d(n) increases to a record.at n=14A053624
• Number of ways to partition 2n+1 into positive integers.at n=19A058695
• Smallest nontrivial partition number divisible by the n-th partition number.at n=14A079032
• Smallest nontrivial partition number divisible by the n-th partition number.at n=18A079032
• Smallest nontrivial partition number divisible by the n-th partition number.at n=17A079032
• Smallest nontrivial partition number divisible by the n-th partition number.at n=16A079032
• a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=21A082637
• Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.at n=29A085844
• Number of partitions of n with at least one odd part.at n=39A086543
• Partition numbers of the form 3*k.at n=16A087183
• Denominators of Taylor series expansion of 3*sin(2*x)/(2*(2+cos(2*x))) (with 0's omitted).at n=5A091197
• Pi*denominators of odd raw moments in the distribution of line lengths for lines picked at random in the unit disk.at n=3A093529
• Number of partitions of n into integers not greater than the squarefree kernel of n.at n=38A098715
• Reduced denominators of x^(2n) in the series expansion of erf(x)^2 Pi/4 about 0.at n=6A103980
• Smallest m such that the m-th Fibonacci number has exactly n divisors that are also Fibonacci numbers.at n=39A105802