1190672

Appears in sequences

• a(0)=1; a(1)=0; a(n) = 2*(n-1)*(a(n-1) + a(n-2)).at n=8A053871
• Triangle read by rows: T(n, k) = number of matchings of 2n people with partners (of either sex) such that exactly k couples are left together.at n=36A055140
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.at n=43A264945
• Triangle read by rows: T(n, k) = (T(n-1, k-1) + T(n-1, k)) * 2 * n with initial values T(n, 0) = Sum_{i=0..n} (-1)^(n-i) * binomial(n, i) * A001147(i) and T(i, j) = 0 if j > i.at n=29A372260
• Triangle read by rows: T(n, k) = (T(n-1, k-1) + T(n-1, k)) * 2 * n with initial values T(n, 0) = Sum_{i=0..n} (-1)^(n-i) * binomial(n, i) * A001147(i) and T(i, j) = 0 if j > i.at n=36A372260