354033
domain: N
Appears in sequences
- Triangle, read by rows, T(n,k) = Sum_{j=1..k} binomial(n-1, j-1)*binomial(k, j - 1)*(j-1)!.at n=42A176122
- E.g.f. A(x) = exp(x+x^2+x^3+x^4+x^5+x^6+x^7).at n=8A193933
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=33A207165
- Triangle read by rows: T(n,k) is the number of nilpotent subpermutations on an n-set, each of nilpotency index less than or equal to k.at n=43A261764
- Triangle read by rows, T(n, k) = A000262(n) - A349776(n, n - k) for n > 0 and T(0, 0) = 1.at n=43A349780
- a(n) = n! * (hypergeom([1 - n], [2], -1) - 1) for n >= 1 and a(0) = 0.at n=8A349781