146140
domain: N
Appears in sequences
- Number of ways of partitioning the multiset {1,1,2,3,...,n-1} into exactly five nonempty parts.at n=6A168585
- Numbers k for which 10k+1, 10k+3, 10k+7, 10k+9, 10k+13 and 10k+19 are primes.at n=8A178083
- Smallest k such that k*2*p(n)^2-1=q is prime, k*2*q^2-1=r, k*2*r^2-1=s, k*2*r^2-1=t, r, s, and t are also prime.at n=22A224492
- Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.at n=59A241500