A259029 Partial sums of A259024.

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

Offset

1,16

Comments

|a(A259031(n))| = n and |a(m)| != n for m < A259031(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

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

Cf. A259024, A259031.

Sequence in context: A268917 A176811 A057594 * A286128 A197547 A239723

Adjacent sequences: A259026 A259027 A259028 * A259030 A259031 A259032

Keyword

sign,easy

Author

Reinhard Zumkeller, Jun 17 2015

Status

approved