A379225 a(n) = A113177(n) mod 5, where A113177 is fully additive with a(p) = Fibonacci(p).

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

Author

Antti Karttunen, Dec 20 2024

Keywords

• nonn

Links

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

Crossrefs

Cf. A000045, A030426, A010874, A082116, A113177, A374208, A374124, A379226 (positions of 0's), A379227.

Cf. also A379115.

Programs

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);

Formula

a(n) = A010874(A113177(n)) = A010874(A374124(n)).