-16584

Appears in sequences

• a(n) = (2n+1)*(n+1)!*Bernoulli(2n).at n=6A263445
• 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=22A354042