55153
domain: N
Appears in sequences
- a(0) = a(1) = 1; for n > 1, a(n) = n*a(n-1) + (-1)^n.at n=8A001120
- Number of (n+2) X 6 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..1 introduced in row major order.at n=18A204377
- a(n) = n*a(n-1) + (-1)^n for n>0, a(0)=2.at n=8A236438
- Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and every four consecutive elements having its maximum within 4 of its minimum.at n=24A263712
- A(n,k) = !n + [n > 0] * (k * n!), where !n = A000166(n) is subfactorial of n and [] is an Iverson bracket; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=53A334715