31260
domain: N
Appears in sequences
- Numbers k such that the k-th Euclid number A006862(k) = 1 + (Product of first k primes) is prime.at n=21A014545
- A088257 indexed by A002110.at n=36A088411
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (j+1)*prime(j)*T(n-2, k-1) with j=4, read by rows.at n=23A153649
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (j+1)*prime(j)*T(n-2, k-1) with j=4, read by rows.at n=25A153649
- Sequence generated from Lim:_{n..inf.} M^n, M = an infinite lower triangular matrix with (1,3,3,3,...) in every column, shifted down twice.at n=45A171370
- Total number of parts of multiplicity 7 in all partitions of n.at n=46A222707
- Expansion of a q-series used by Ramanujan in his Lost Notebook.at n=19A292445
- Numbers k such that Bernoulli number B_{k} has denominator 56786730.at n=5A295598
- Number of n element multisets of the 10th roots of unity with zero sum.at n=45A321416
- Triangular array read by rows. T(n,k) is the number of partial functions f on [n] such that there are exactly k points in [n] that are neither in the domain of f nor in the image of f, n>=0, 0<=k<=n.at n=22A377763