login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228297 Generalized meta-Fibonacci sequence a(n) with parameters s=0 and k=5. 3

%I #58 Dec 30 2023 23:56:58

%S 1,2,3,4,5,5,6,7,8,9,10,10,11,12,13,14,15,15,16,17,18,19,20,20,21,22,

%T 23,24,25,25,25,26,27,28,29,30,30,31,32,33,34,35,35,36,37,38,39,40,40,

%U 41,42,43,44,45,45,46,47,48,49,50,50,50,51,52,53

%N Generalized meta-Fibonacci sequence a(n) with parameters s=0 and k=5.

%C 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

%H Michael De Vlieger, <a href="/A228297/b228297.txt">Table of n, a(n) for n = 1..10000</a>

%H C. Deugau and F. Ruskey, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Ruskey/ruskey6.html">Complete k-ary Trees and Generalized Meta-Fibonacci Sequences</a>, J. Integer Seq., Vol. 12, 2009, Article 09.4.3.

%F a(n) = A007845(n)/5. - _M. F. Hasler_, Dec 27 2019

%t Array[ConstantArray[#, IntegerExponent[#, 5] + 1] &, 53] // Flatten (* _Michael De Vlieger_, Feb 08 2020 *)

%o (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];);}

%o (HP 49G calculator)

%o « DUPDUP 5 IQUOT -

%o WHILE DUP 0 OVER

%o DO 5 IQUOT DUP

%o ROT + SWAP DUP NOT

%o UNTIL

%o END DROP +

%o PICK3 <

%o REPEAT 1 +

%o END NIP

%o » _Gerald Hillier_, Sep 19 2017

%Y Cf. A120503, A120507, A228298.

%K nonn

%O 1,2

%A _Michel Marcus_, Aug 20 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)