26015

Appears in sequences

• a(n) is the number of partitions of n (the partition numbers).at n=38A000041
• Number of paraffins.at n=47A005999
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=40A024686
• Earliest sequence where a(a(n))=number of partitions of n.at n=39A038752
• Nonprime partition numbers.at n=30A038753
• Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=38A039896
• Denominators of continued fraction convergents to sqrt(683).at n=9A042313
• Odd partition numbers.at n=21A052003
• Number of ways to partition 2n into positive integers.at n=19A058696
• Number of n-digit 7-smooth numbers (A002473).at n=23A085630
• Partition numbers of the form 3*k+2.at n=10A087185
• Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=26A091114
• Number of partitions of n into integers not greater than the squarefree kernel of n.at n=37A098715
• Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=24A111329
• 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=15A111451
• Triangle T, read by rows, where row n+1 of T = row n of T^(2n-1) with appended '1' for n>=0 with T(0,0)=1.at n=30A132615
• Column 2 of triangle A132615.at n=5A132618
• Odd partition numbers of even numbers.at n=11A154797
• a(n) = 144*n^2 - 161*n + 45.at n=13A156711
• Cyclops partition numbers.at n=1A183056