40296

Appears in sequences

• Differences of two factorial numbers.at n=25A051949
• Moebius transform of n!.at n=7A062794
• Solution to the Dancing School Problem with 9 girls and n+9 boys: f(9,n).at n=4A079914
• Solution to the Dancing School Problem with n girls and n+4 boys: f(n,4).at n=8A079923
• Triangle read by rows: expansion of p(x,t) = b(x,t)*u(x,t)*h(x,t) where b(x,t) = t*exp(x*t)/(exp(t)-1), u(x,t) = 1/(1-2*x*t+t^2), and h(x,t) = exp(2*x*t-t^2).at n=10A137981
• Number of 3 X 3 magilatin squares with positive values < n.at n=10A173548
• 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=39A177263
• 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=41A177264
• Ordered differences of factorials.at n=24A204930
• Number of nX5 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=3A302262
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=31A302265
• Number of 4 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302268
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-3) + b(n), where a(0) = 1, a(1) = 2, a(2) = 3, b(0)= 4, b(1) = 5, b(2) = 6; b(3) = 7. See Comments.at n=17A305746
• Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a factorial number (A000142).at n=34A353969
• Triangle read by rows: T(n,k) = (-1)^n * n! + (-1)^(k+1) * k! for n >= 2 and 1 <= k <= n-1.at n=24A373967