This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A288424 Partial sums of A288384. 3
 0, 0, 1, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 2, 2, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 COMMENTS It appears that the number of zeros is infinite. Observation: at least for the first 110 terms the largest distance between two zeros that are between nonzero terms is 3. Question: are there distances > 3? From Hartmut F. W. Hoft, Jun 13 2017: (Start) Yes: a(346...351) = {0,1,2,3,4,0). Conjecture: a(n)>=0, for all n>=0, and a(n) is unbounded. First occurrences are: 3 = a(337) occurring 27 times; 4 = a(350) occurring 8 times; 5 = a(830) occurring 5 times; all through n=2500. (End) LINKS MATHEMATICA (* function a288384[] is defined in A288384 *) a288424[n_] := Accumulate[a288384[n]] a288424[104] (* data *) (* Hartmut F. W. Hoft, Jun 13 2017 *) CROSSREFS Cf. A274650, A286294, A288384. Sequence in context: A117886 A145723 A085977 * A127325 A259660 A119842 Adjacent sequences:  A288421 A288422 A288423 * A288425 A288426 A288427 KEYWORD nonn AUTHOR Omar E. Pol, Jun 09 2017 EXTENSIONS Reversed the signs at suggestion of Hartmut F. W. Hoft. - Omar E. Pol, Jun 13 2017 STATUS approved

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

Last modified January 16 21:37 EST 2019. Contains 319206 sequences. (Running on oeis4.)