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!)
 A362130 a(n) = A000005(A360179(n)) mod 2. 2
 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0 (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~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[f[k], 2]], {n, 2, nn}], n]][[-1, -1]] CROSSREFS Cf. A000005, A360179, A362129. Sequence in context: A369967 A256432 A218171 * A361018 A232714 A274179 Adjacent sequences: A362127 A362128 A362129 * A362131 A362132 A362133 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 20 11:55 EDT 2024. Contains 372712 sequences. (Running on oeis4.)