OFFSET
1,8
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
f[p_, e_] := p^(e * (1 - ThueMorse[e])); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(hammingweight(f[i, 2])%2, 1, f[i, 1]^f[i, 2])); }
(Python)
from math import prod
from sympy import factorint
def A367513(n): return prod(p**e for p, e in factorint(n).items() if e.bit_count()&1^1) # Chai Wah Wu, Nov 23 2023
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Amiram Eldar, Nov 21 2023
STATUS
approved