109600

Appears in sequences

• a(n) = n*(a(n-1) + 1), a(0) = 0.at n=8A007526
• Numbers k such that 133*2^k+1 is prime.at n=28A032416
• Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).at n=37A073107
• Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.at n=36A081114
• Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.at n=16A082458
• Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=28A121662
• Array read by antidiagonals: see A128195 for details.at n=43A126062
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 9.at n=52A136830
• 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=37A271705
• 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=35A285268
• T(n,k) = [0<k<=n] * n*(T(n-1,k-1)+T(n-1,k)) + [k=0 and n>=0]; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=37A326659
• 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=35A334156
• 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=53A337085
• 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=37A343804
• Triangle read by rows. T(n, k) = Sum_{j=0..k} (n!/j!).at n=43A367962
• Triangle read by rows: T(n, k) = e * binomial(n, k) * Gamma(k + 1, 1).at n=43A371686
• Triangle read by rows: T(n, k) = n * k * (T(n-1, k-1) + T(n-1, k)) for k > 0 with initial values T(n, 0) = 1 and T(i, j) = 0 for j > i.at n=37A371898