16936857domain: NAppears in sequencesDerangement numbers d(n,3) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.at n=8A033030Triangle read by rows: T(n, k) = (Sum_{i=0..n-k} (-1)^i * binomial(n-k, i) * A007559(n-i)) * n! / ((n-k)! * A007559(k)) for 0 <= k <= n.at n=36A372921