35900
domain: N
Appears in sequences
- Alternating factorials: 0! - 1! + 2! - ... + (-1)^n n!at n=8A058006
- a(0) = 0, a(1) = 1, and for n >= 2, a(n) = (n-1) * a(n-2) + (n-2) * a(n-1).at n=9A153229
- T(n, k) = [x^k] Sum_{j=0..n} j!*binomial(x, j), for 0 <= k <= n, triangle read by rows.at n=46A176663
- a(n) = prime(n)^3 - prime(n^3).at n=11A262199
- Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.at n=38A297526
- Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=25A350793