login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A379225
a(n) = A113177(n) mod 5, where A113177 is fully additive with a(p) = Fibonacci(p).
0
0, 1, 2, 2, 0, 3, 3, 3, 4, 1, 4, 4, 3, 4, 2, 4, 2, 0, 1, 2, 0, 0, 2, 0, 0, 4, 1, 0, 4, 3, 4, 0, 1, 3, 3, 1, 2, 2, 0, 3, 1, 1, 2, 1, 4, 3, 3, 1, 1, 1, 4, 0, 3, 2, 4, 1, 3, 0, 1, 4, 1, 0, 2, 1, 3, 2, 3, 4, 4, 4, 4, 2, 3, 3, 2, 3, 2, 1, 1, 4, 3, 2, 2, 2, 2, 3, 1, 2, 4, 0, 1, 4, 1, 4, 1, 2, 2, 2, 3, 2, 1, 0, 2, 1, 0
OFFSET
1,3
LINKS
FORMULA
a(n) = A010874(A113177(n)) = A010874(A374124(n)).
PROG
(PARI)
A113177(n) = if(n<=1, 0, my(f=factor(n)); sum(i=1, #f~, f[i, 2]*fibonacci(f[i, 1])));
A379225(n) = (A113177(n)%5);
CROSSREFS
Cf. also A379115.
Sequence in context: A295675 A135356 A259016 * A216504 A216673 A363532
KEYWORD
nonn,new
AUTHOR
Antti Karttunen, Dec 20 2024
STATUS
approved