[go: up one dir, main page]

login
A374053
Multiplicative with a(3^k) = 0, a(p^2k) = 0 and a(p^(2k+1)) = 1 if p == 1 (mod 3), and a(p^2k) = 1 and a(p^(2k+1)) = 0, if p == -1 (mod 3).
2
1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
1
COMMENTS
This differs from A070563 for the first time at n=2401.
PROG
(PARI) A374053(n) = { my(f=factor(n)); prod(i=1, #f~, if(0==(f[i, 1]%3), 0, if(1==(f[i, 1]%3), f[i, 2]%2, (1+f[i, 2])%2))); };
CROSSREFS
Sequence in context: A014099 A037011 A070563 * A024692 A373604 A079978
KEYWORD
nonn,mult
AUTHOR
Antti Karttunen after Christian G. Bower's conjectured formula for A070563, Jul 03 2024
STATUS
approved