9864100
domain: N
Appears in sequences
- a(n) = n*(a(n-1) + 1), a(0) = 0.at n=10A007526
- Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.at n=55A081114
- Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.at n=20A082458
- Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=45A121662
- 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=54A285268