login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A259029 Partial sums of A259024. 3
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
|a(A259031(n))| = n and |a(m)| != n for m < A259031(n).
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
Sequence in context: A268917 A176811 A057594 * A286128 A197547 A239723
KEYWORD
sign,easy
AUTHOR
Reinhard Zumkeller, Jun 17 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)