808393

Appears in sequences

• a(n) = n*a(n-1) + (n-2)*a(n-2), with a(0) = 0, a(1) = 1.at n=9A000153
• Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=63A060475
• Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).at n=52A076731
• Array read by upwards antidiagonals: T(n,k) is the number of ways to place n persons on different seats such that each person number p, 1 <= p <= n, differs from the seat number s(p), 1 <= s(p) <= n+k, k >= 0.at n=47A336246
• Triangle read by rows: T(n, k) = (Sum_{i=0..n-k} (-1)^i * binomial(n-k, i) * (n+2-i)!) * binomial(n, k) / ((k+1) * (k+2)) for 0 <= k <= n.at n=36A373050