OFFSET
1,2
COMMENTS
Each integer n appears x+1 times where x is the greatest power of 5 in the factorization of n!. - Gerald Hillier, Feb 08 2020
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, J. Integer Seq., Vol. 12, 2009, Article 09.4.3.
FORMULA
a(n) = A007845(n)/5. - M. F. Hasler, Dec 27 2019
MATHEMATICA
Array[ConstantArray[#, IntegerExponent[#, 5] + 1] &, 53] // Flatten (* Michael De Vlieger, Feb 08 2020 *)
PROG
(PARI) a(n)= {local(A); if(n<=5, max(0, n), A=vector(n, i, i); for(k=6, n, A[k]= A[k-A[k-1]] + A[k-1-A[k-2]] + A[k-2-A[k-3]] + A[k-3-A[k-4]] + A[k-4-A[k-5]]; ); A[n]; ); }
(HP 49G calculator)
« DUPDUP 5 IQUOT -
WHILE DUP 0 OVER
DO 5 IQUOT DUP
ROT + SWAP DUP NOT
UNTIL
END DROP +
PICK3 <
REPEAT 1 +
END NIP
» Gerald Hillier, Sep 19 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Aug 20 2013
STATUS
approved