The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A362129 a(n) = A360179(n) mod 2. 3
 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 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, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 LINKS Michael De Vlieger, Table of n, a(n) for n = 1..40000 Michael De Vlieger, 4096 X 4096 pixel bitmap of a(n), n = 1..2^24. MATHEMATICA nn = 120; c[_] := False; h[_] := 0; f[n_] := DivisorSigma[0, n]; a[1] = j = u = 1; {1}~Join~Rest@ Reap[Do[ If[c[j], k = j + f[u]; h[j]++; h[u]--, k = f[j]; c[j] = True; h[j]++ ]; u = Min[u, j]; Set[{a[n], j}, {k, k}]; While[h[u] == 0, u++]; Sow[Mod[k, 2]], {n, 2, nn}] ][[-1, -1]] CROSSREFS Cf. A000005, A360179. Sequence in context: A267418 A263919 A371689 * A267520 A114915 A360120 Adjacent sequences: A362126 A362127 A362128 * A362130 A362131 A362132 KEYWORD nonn AUTHOR Michael De Vlieger, Apr 09 2023 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.

Last modified May 29 13:46 EDT 2024. Contains 372941 sequences. (Running on oeis4.)