362878

Appears in sequences

• Differences of two factorial numbers.at n=35A051949
• A recursive triangular sequence with row sums (2*(n + 5)!): A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (n + 4)*(n + 3)*A(n - 2, k - 1).at n=7A153737
• A recursive triangular sequence with row sums (2*(n + 5)!): A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (n + 4)*(n + 3)*A(n - 2, k - 1).at n=8A153737
• 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=51A177263
• 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=48A177264
• Ordered differences of factorials.at n=29A204930
• Number of permutations of {1..n} with fewer than 7 interior elements having values lying between the values of their neighbors.at n=9A226440
• Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than 7 times.at n=7A248841
• a(n) = n! - 2.at n=9A261193
• Numbers k such that k divides the sum of digits in factorial base of all numbers from 1 to k.at n=36A333702
• Triangle read by rows, T(n,k) with n,k > 1, is the number of subsequences of length k over all permutations of [n], which are neither increasing or decreasing.at n=35A373766
• Triangle read by rows: T(n, k) is the number of permutations of length n, which contain the maximum number of distinct patterns of length k.at n=37A373877