login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1
LINKS
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
Sequence in context: A267418 A263919 A371689 * A267520 A114915 A360120
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Apr 09 2023
STATUS
approved