login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324905 a(n) = A007895(A003965(n)). 4
1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 3, 2, 2, 1, 2, 3, 2, 3, 3, 1, 3, 1, 3, 2, 2, 3, 2, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 1, 3, 3, 3, 2, 3, 1, 4, 3, 3, 2, 2, 1, 2, 1, 2, 4, 3, 3, 3, 1, 3, 2, 4, 1, 4, 1, 2, 4, 3, 3, 3, 1, 4, 3, 2, 1, 3, 3, 2, 2, 3, 1, 2, 3, 3, 2, 2, 3, 3, 1, 3, 4, 3, 1, 3, 1, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..17711

Index entries for sequences computed from indices in prime factorization

FORMULA

a(n) = A007895(A003965(n)).

PROG

(PARI)

A003965(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(2+primepi(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

A324905(n) = A007895(A003965(n));

CROSSREFS

Cf. A003965, A007895, A300837, A324888, A324907.

Sequence in context: A039736 A093921 A140192 * A240231 A065373 A047895

Adjacent sequences:  A324902 A324903 A324904 * A324906 A324907 A324908

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 12:38 EDT 2021. Contains 347654 sequences. (Running on oeis4.)