46234

Appears in sequences

• Left factorials: !n = Sum_{k=0..n-1} k!.at n=9A003422
• a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.at n=19A049855
• Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.at n=9A071926
• Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.at n=29A071926
• Triangle generated by Pascal's rule, except begin and end the n-th row with n!.at n=37A074911
• Triangle generated by Pascal's rule, except begin and end the n-th row with n!.at n=43A074911
• This table (read by rows) shows the coefficients of sum formulas of n-th subfactorial numbers (A000166). The n-th row (n>=1) contains T(i,n) for i=1 to n, where T(i,n) satisfies Subf(n) = Sum_{i=1..n} T(i,n) * n^(n-i).at n=44A101559
• Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 (m>=1).at n=46A127054
• Triangle read by rows, T(n,k) = Sum_{j=k..n} j!, 0 <= k <= n.at n=36A143122
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the last entry in the first block (1<=k<=n).at n=44A177263
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the first entry in the last block (1<=k<=n).at n=36A177264
• A triangle formed like Pascal's triangle, but with factorial(n) on the borders instead of 1.at n=46A227550
• A triangle formed like Pascal's triangle, but with factorial(n) on the borders instead of 1.at n=53A227550
• Triangle read by rows, T(n,k) = !n + (k-1)*(n-1)!, with n>=1, 1<=k<=n; Position of the first n-letter permutation beginning with number k in the list of lexicographically sorted permutations A030299.at n=36A237450
• Composite numbers k such that phi(x) = psi(k)*phi(k) has no solution.at n=37A292714
• T(n, k) = [x^k] Sum_{j=0..n} Pochhammer(x, j), for 0 <= k <= n, triangle read by rows.at n=46A326326
• Triangle read by rows: T(n,k) = (Sum_{i=k..n} i!)/(k!) for 0 <= k <= n.at n=36A348482
• Triangle read by rows: T(n, k) = Sum_{j=0..n} j! * binomial(n - j, n - k).at n=44A361042