27007
domain: N
Appears in sequences
- Bessel polynomial y_n(x) evaluated at x=1.at n=6A001515
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], where T is the array in A026374.at n=19A026385
- Number of ordered quadruples (a,b,c,d) with gcd(a,b,c,d)=1 (1 <= {a,b,c,d} <= n).at n=12A082540
- a(n) = n^3 + 7.at n=30A084377
- Numerators of numbers with g.f. exp(1-(1-x)^(1/2)).at n=7A143991
- a(0) = a(1) = 1; thereafter a(n) = (2*n-3)*a(n-1) + a(n-2).at n=7A144301
- Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.at n=28A144502
- Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.at n=29A144502
- Triangle read by rows: coefficients of polynomials arising from the recurrence A[n](x) = A[n-1]'(x)/(1-x) with A[0] = exp(x).at n=28A144505
- Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k*n.at n=29A144510
- Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.at n=34A144512
- The point at which the powers of n merge on an 8-digit calculator.at n=3A216069
- Composites in base 10 that remain composite in exactly four bases b, 2 <= b <= 10, expansions interpreted as decimal numbers.at n=14A256354
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=33A270731
- Semiprimes whose binary and ternary representations are prime when read in decimal.at n=31A279052
- Partial sums of A299037.at n=58A299767