-1411200

Appears in sequences

• Let d(m, 0) = 1, d(m, 1) = m, and d(m, k) = (m - k + 1)*d(m+1, k-1) - (k-1)*(m+1) d(m+2, k-2). Sequence gives d(3,n).at n=8A127068
• Triangle T(n, k) = n! * StirlingS1(n, k)/binomial(n, k), read by rows.at n=32A142473
• Coefficient array for the monic X_1-Laguerre polynomials with parameter k=1.at n=46A199580
• Triangle read by rows. The Faulhaber numbers. F(0, k) = 1 and otherwise F(n, k) = (n + 1)!*(-1)^(k+1)*Sum_{j=0..floor((k-1)/2)} C(2*k-2*j, k+1)*C(2*n+1, 2*j+1) * Bernoulli(2*n-2*j) / (k - j).at n=30A354042