A324901 a(n) = A007895(A324900(n)).

1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 2, 4, 2, 4, 3, 6, 2, 5, 2, 5, 4, 4, 2, 6, 3, 4, 6, 5, 2, 3, 2, 7, 4, 4, 3, 7, 2, 4, 4, 5, 2, 7, 2, 6, 6, 4, 2, 7, 3, 6, 4, 6, 2, 5, 4, 4, 4, 4, 2, 5, 2, 4, 5, 7, 4, 7, 2, 6, 4, 5, 2, 8, 2, 4, 5, 6, 3, 8, 2, 9, 8, 4, 2, 5, 4, 4, 4, 11, 2, 6, 4, 6, 4, 4, 4, 10, 2, 6, 5, 5, 2, 8, 2, 11, 8

Offset: 1

Author

Antti Karttunen, Apr 15 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..20000
• Index entries for sequences computed from indices in prime factorization

Crossrefs

Cf. A000032, A007895, A324900, A324905, A324907.

Programs

PARI

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

Formula

a(n) = A007895(A324900(n)).