OFFSET
1,2
LINKS
Scott R. Shannon, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Bitmap of (a(n-1) + a(n)), n = 1..2^11, 12X vertical exaggeration, read horizontally where black represents 1 and white 0, with least significant bit on bottom.
Michael De Vlieger, Let sequence b list primitive terms in this sequence. Annotated plot a(n) = b(k) at (n, k) for n = 1..84.
Michael De Vlieger, Plot a(n) = b(k) at (n, k) for n = 1..2^12.
Scott R. Shannon, Image for n = 0..2250000.
MATHEMATICA
nn = 120; c[_] = False; j = a[0] = 0; u = 1; w = "0"; Do[k = u; While[Or[c[k], StringContainsQ[w, Set[v, IntegerString[j + k, 2]]]], k++]; Set[{a[n], c[k], b[n]}, {k, True, j + k}]; Set[{j, w}, {k, w <> IntegerString[k, 2]}]; If[k == u, While[c[u], u++]], {n, nn}], n]; Array[b, nn] (* Michael De Vlieger, Sep 15 2022 *)
PROG
(Python)
from itertools import islice
def agen():
aset, astr, an, mink = {0}, "0", 0, 1
while True:
k = mink
while k in aset or bin(an+k)[2:] in astr: k += 1
while mink in aset: mink += 1
yield an+k; an = k; aset.add(an); astr += bin(an)[2:]
print(list(islice(agen(), 63))) # Michael S. Branicky, Sep 16 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Sep 15 2022
STATUS
approved