986409

Appears in sequences

• a(n) = n*(a(n-1) + 1), a(0) = 0.at n=9A007526
• Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).at n=46A073107
• Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.at n=45A081114
• Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.at n=18A082458
• Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=36A121662
• Triangle read by rows, T(n,k) = Sum_{j=0..n} C(n,j)*L(j,k), L the unsigned Lah numbers A271703, for n>=0 and 0<=k<=n.at n=46A271705
• Triangle read by rows: T(m,n) = Sum_{i=1..n} P(m,i) where P(m,n) = m!/(m-n)! is the number of permutations of m items taken n at a time, for 1 <= n <= m.at n=44A285268
• Number of multiples of n which have only distinct and nonzero digits in base 10.at n=1A328287
• Triangle T(m,n) = # { k | concat(mk,nk) has no digit twice or more }, m >= n >= 0.at n=1A328288
• Triangle read by rows: T(n,m) is the number of length n decorated permutations avoiding the word 0^m = 0...0 of m 0's, where 1 <= m <= n.at n=44A334156
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) = n! * Sum_{j=0..n} j^k/j!.at n=64A337085
• T(n, k) = Sum_{j=k..n} binomial(n, j)*E2(j, j-k), where E2 are the Eulerian numbers A201637. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=46A343804
• Triangle read by rows: T(n, k) = e * binomial(n, k) * Gamma(k + 1, 1).at n=53A371686