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

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

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: A093921 A353426 A140192 * A240231 A366075 A065373

Adjacent sequences: A324902 A324903 A324904 * A324906 A324907 A324908

Keyword

nonn

Author

Antti Karttunen, Apr 14 2019

Status

approved