74879

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=43A025110
• Smallest number k such that n! - k is a square.at n=12A066857
• Start to read the sequence digit by digit and erase the first "1" you encounter, then the first "2", the first "3", etc., until the first "9"; go on from there and erase again the first "1", the first "2", etc., until "9" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence.at n=14A108709
• 3n^3 + 2n^2 + n + 1.at n=29A130884
• Least number k >= 0 such that n! - k is a perfect power.at n=12A240940
• The distance between n! and the nearest perfect square.at n=13A260374