40440

Appears in sequences

• Sums of nonconsecutive factorial numbers.at n=42A060112
• Integers of the form m! + n!, m and n = positive integers.at n=32A066847
• (n^4 - 10*n^2 + 15*n - 6)/2.at n=16A135916
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, -1), (1, 1, 1)}.at n=8A150687
• A recursion triangle sequence based on the Eulerian numbers: A(n,k)=n*A(n-1,k-1)+k*Eulerian(n-1,k).at n=28A157743
• Numbers whose decimal expansion contains only 0's and 4's.at n=22A169967
• Numbers that can be written using its own digits in order and by using addition and factorial operators.at n=13A195670
• E.g.f. satisfies: A(x) = x-1 + exp(A(x)^2).at n=5A200319
• Integers which can be partitioned into two distinct factorials. 0! and 1! are not considered distinct.at n=25A301523
• Number of non-extendable self-avoiding walks in an n X n grid starting at the top left corner.at n=4A341269
• a(n) = Sum_{p|n, p prime} (n-p)!.at n=9A351710
• Triangle read by rows: T(n,k) = (-1)^n * n! + (-1)^(k+1) * k! for n >= 2 and 1 <= k <= n-1.at n=25A373967