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!)
A324907 a(n) = A007895(A113175(n)). 4
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 3, 2, 1, 1, 1, 3, 1, 2, 1, 1, 2, 1, 1, 3, 1, 3, 2, 1, 1, 2, 3, 1, 2, 1, 1, 3, 1, 4, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 1, 3, 4, 1, 2, 1, 3, 1, 1, 4, 3, 3, 1, 2, 1, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
LINKS
FORMULA
a(n) = A007895(A113175(n)).
a(2n) = a(n).
PROG
(PARI)
A113175(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(f[i, 1])); factorback(f); };
A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
CROSSREFS
Sequence in context: A369257 A257743 A033272 * A331295 A325133 A236338
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 14 2019
STATUS
approved

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 April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)