876809

Appears in sequences

• a(n) = Sum_{k=0..n} (k+1)! binomial(n,k).at n=8A001339
• Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the factorials, starting with row 0: {1!,2!,3!,...}.at n=46A089900
• Numerators of certain upper bounds for Euler's number e.at n=7A095822
• Square array read by antidiagonals: form the Euler-Seidel matrix for the sequence {k!} and then divide column k by k!.at n=46A143409
• Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!*C(n-1,j-1)*T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.at n=46A256895
• Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*L(j,k), L the unsigned Lah numbers A271703, for n>=0 and 0<=k<=n.at n=46A271704
• Square array A(row,col) = Sum_{k=0..row} binomial(row,k)*(1+col+k)!, read by descending antidiagonals as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ...at n=44A276588
• Transpose of A276588.at n=36A276589