40322

Appears in sequences

• Sums of nonconsecutive factorial numbers.at n=36A060112
• Sum of factorials of the digits of n.at n=28A061602
• Integers of the form m! + n!, m and n = positive integers.at n=29A066847
• Semiprimes (A001358) that are sums of distinct factorials.at n=39A115646
• Arises in a simple, polynomial-time algorithm for the matrix torsion problem.at n=2A140656
• Places of records of A188550.at n=22A188592
• Number of lower triangles of a 5 X 5 0..n array with each element differing from all of its horizontal and vertical neighbors by one.at n=15A195001
• a(1) = 0, a(n) = (e1*i1! + e2*i2! + ... + ez*iz!) for n = prime(i1)^e1 * prime(i2)^e2 * ... * prime(iz)^ez, where prime(k) is the k-th prime, A000040(k).at n=56A276075
• Integers which can be partitioned into two distinct factorials. 0! and 1! are not considered distinct.at n=22A301523
• G.f. A(x) satisfies: A(x) = x*exp(A(-x) - A(-x^2)/2 + A(-x^3)/3 - A(-x^4)/4 + ...).at n=29A307366
• Expansion of Product_{k>=2} 1/(1 - k*x^k).at n=19A317912