386155
domain: N
Appears in sequences
- Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-2)/2.at n=24A047184
- Odd partition numbers.at n=31A052003
- Number of ways to partition 2n into positive integers.at n=27A058696
- Smallest partition number divisible by n.at n=16A072871
- Partition numbers of the form 3*k+1.at n=15A087184
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=38A091114
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=39A091114
- Smallest partition number with n-th prime as factor.at n=6A091689
- Smallest partition number with n-th prime as factor.at n=16A091689
- Number of partitions of 3-smooth numbers.at n=15A117221
- Irregular triangle which contains in row n those partition numbers A000041(n*prime(m) + m + 1) which are congruent to 0 mod prime(m) for 1 <= m <= n.at n=15A117749
- Irregular triangle which contains in row n those partition numbers A000041(n*prime(m) + m + 1) which are congruent to 0 mod prime(m) for 1 <= m <= n.at n=26A117749
- Irregular triangle which contains in row n those partition numbers A000041(n*(2m+1) + m + 2) which are congruent to 0 mod (2m+1) for 1 <= m <= n.at n=14A117750
- Irregular triangle which contains in row n those partition numbers A000041(n*(2m+1) + m + 2) which are congruent to 0 mod (2m+1) for 1 <= m <= n.at n=23A117750
- Odd partition numbers of even numbers.at n=15A154797
- Partition numbers p(n) having opposite parity of n.at n=25A209659
- p(5n+4) where p(k) = number of partitions of k = A000041(k).at n=10A213260
- a(n) = p(7*n + 5), where p(k) = number of partitions of k = A000041(k).at n=7A213261
- Partition numbers of the form 5k.at n=15A225325
- Partition numbers of the form 7k.at n=19A225327