|
|
|
|
1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, -1, 0, 0, 1, 2, 1, 1, 2, 1, 0, 0, -1, -1, 0, 0, 0, 1, 0, 0, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 0, 0, 1, 0, 0, 0, -1, -2, -1, -1, 0, 1, 0, 0, 1, 1, 0, 0, -1, 0, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,16
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
f[p_, e_] := If[Mod[p, 6] == 1, 1, (-1)^e]; f[2, e_] := (1 + (-1)^e) / 2; f[3, 1] = -1; f[3, e_] := 0; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; Accumulate[Array[s, 100]] (* Amiram Eldar, Sep 02 2023 *)
|
|
PROG
|
(Haskell)
a259029 n = a259029_list !! (n-1)
a259029_list = scanl1 (+) a259024_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|