|
|
A069517
|
|
a(n) = (-1)*Sum_{d|n} (moebius(d)*(-1)^d).
|
|
3
|
|
|
1, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Multiplicative because A037227 is. (End)
|
|
LINKS
|
|
|
FORMULA
|
Multiplicative with a(2^e) = 2 and a(p^e) = 0 for an odd prime p. - Amiram Eldar, Aug 29 2023
|
|
MATHEMATICA
|
a[n_] := If[n == 2^IntegerExponent[n, 2], 2, 0]; a[1] = 1; Array[a, 100] (* Amiram Eldar, Aug 29 2023 *)
|
|
PROG
|
(PARI) a(n) = if(n == 1, 1, if(n >> valuation(n, 2) == 1, 2, 0)); \\ Amiram Eldar, Aug 29 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|