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”).

A372470
Multiplicative with a(p^e) = e+1 if e+1 is a power of 2, and 0 otherwise.
3
1, 2, 2, 0, 2, 4, 2, 4, 0, 4, 2, 0, 2, 4, 4, 0, 2, 0, 2, 0, 4, 4, 2, 8, 0, 4, 4, 0, 2, 8, 2, 0, 4, 4, 4, 0, 2, 4, 4, 8, 2, 8, 2, 0, 0, 4, 2, 0, 0, 0, 4, 0, 2, 8, 4, 8, 4, 4, 2, 0, 2, 4, 0, 0, 4, 8, 2, 0, 4, 8, 2, 0, 2, 4, 0, 0, 4, 8, 2, 0, 0, 4, 2, 0, 4, 4, 4
OFFSET
1,2
LINKS
FORMULA
a(n) = A359473(n)*A000005(n).
a(A036537(n)) = A000005(A036537(n)) = A372468(n).
MATHEMATICA
f[p_, e_] := If[e + 1 == 2^IntegerExponent[e + 1, 2], e + 1, 0]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = vecprod(apply(x -> if(x+1 == 1 << valuation(x+1, 2), x+1, 0), factor(n)[, 2]));
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Amiram Eldar, May 02 2024
STATUS
approved