367920

Appears in sequences

• a(0) = 1, a(1) = 1, a(n) = n! + (n-2)! for n >= 2.at n=9A108217
• a(n) + a(n+1) + a(n+2) = 3^n.at n=13A152733
• Generalized factorions: numbers which are equal to the sum of the factorials of some or all of their digits in base 10.at n=10A163752
• Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )!at n=29A211368
• Square array A(row,col) read by antidiagonals: A(1,col) = A273670(col-1), and for row > 1, A(row,col) = A153880(A(row-1,col)); Dispersion of factorial base shift A153880 (array transposed).at n=61A276953
• Square array A(row,col): A(row,1) = A273670(row-1), and for col > 1, A(row,col) = A153880(A(row,col-1)); Dispersion of factorial base left shift A153880.at n=59A276955
• Integers which can be partitioned into two distinct factorials. 0! and 1! are not considered distinct.at n=34A301523
• Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m.at n=41A321668
• a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.at n=49A351328