40442

Appears in sequences

• a(n) = Sum_{t=0..n} g(t)*g(n-t) where g(t) = A002121(t).at n=49A002122
• a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.at n=33A049724
• Sums of nonconsecutive factorial numbers.at n=44A060112
• Numbers that can be written using its own digits in order and by using addition and factorial operators.at n=15A195670
• Numbers k such that (k-1)^2 + k^2 + (k+1)^2 is a palindrome.at n=12A233007
• Number of (n+1)X(1+1) 0..3 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A237967
• Number of (n+1) X (4+1) 0..3 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237970
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=6A237974
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=9A237974
• a(n) = cardinality of a certain set of natural numbers defined using A117818.at n=24A292772
• Least number k such that A304036(k) = n.at n=25A304039
• 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=53A351328
• a(n) = Sum_{k=0..floor(n/3)} (n-3*k)!.at n=8A358498