17977

Properties

Appears in sequences

• a(n) is the number of partitions of n (the partition numbers).at n=36A000041
• Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=30A007996
• Convolution of composite numbers and odd numbers.at n=30A023650
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 66 ones.at n=35A031834
• Earliest sequence where a(a(n))=number of partitions of n.at n=37A038752
• Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=36A039896
• Numerators of continued fraction convergents to sqrt(573).at n=4A042098
• Prime partition numbers.at n=6A049575
• Odd partition numbers.at n=19A052003
• Number of ways to partition 2n into positive integers.at n=18A058696
• Number of partitions of n*(n-1)/2.at n=8A066655
• Largest prime factor of p(n), the n-th partition number A000041(n) (with a(0) = a(1) = 1 by convention).at n=36A071963
• Number of partitions of n^2.at n=6A072213
• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=27A078851
• Smallest prime factor of n-th partition number.at n=35A087173
• Partition numbers of the form 3*k+1.at n=10A087184
• T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.at n=47A090011
• T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.at n=52A090011
• Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=25A091114
• Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=24A091114