A319690 Fully multiplicative with a(p^e) = (p mod 3)^e.

1, 2, 0, 4, 2, 0, 1, 8, 0, 4, 2, 0, 1, 2, 0, 16, 2, 0, 1, 8, 0, 4, 2, 0, 4, 2, 0, 4, 2, 0, 1, 32, 0, 4, 2, 0, 1, 2, 0, 16, 2, 0, 1, 8, 0, 4, 2, 0, 1, 8, 0, 4, 2, 0, 4, 8, 0, 4, 2, 0, 1, 2, 0, 64, 2, 0, 1, 8, 0, 4, 2, 0, 1, 2, 0, 4, 2, 0, 1, 32, 0, 4, 2, 0, 4, 2, 0, 16, 2, 0, 1, 8, 0, 4, 2, 0, 1, 2, 0, 16, 2, 0, 1, 8, 0, 4, 2, 0, 1, 8, 0, 16, 2, 0, 4, 8, 0, 4

Offset: 1

Author

Antti Karttunen, Oct 04 2018

Keywords

• nonn
• mult

Links

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

Crossrefs

Cf. A065338, A319691.

Programs

PARI

A319690(n) = { my(f=factor(n)); prod(i=1, #f~, (f[i, 1]%3)^f[i, 2]); };