# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a357148
Showing 1-1 of 1

%I A357148 #16 Sep 16 2022 23:45:19
%S A357148 1,3,5,7,9,15,16,15,16,24,29,32,33,29,34,29,32,36,34,42,61,64,34,32,
%T A357148 61,64,61,64,61,64,65,72,76,64,72,85,76,64,72,82,64,72,100,104,100,91,
%U A357148 64,72,64,72,104,100,116,127,128,129,133,128,129,128,129,128,129
%N A357148 a(n) = A357082(n-1) + A357082(n).
%H A357148 Scott R. Shannon, <a href="/A357148/b357148.txt">Table of n, a(n) for n = 1..10000</a>
%H A357148 Michael De Vlieger, <a href="https://oeis.org/A357082/a357082_5.png">Bitmap of (a(n-1) + a(n))</a>, n = 1..2^11, 12X vertical exaggeration, read horizontally where black represents 1 and white 0, with least significant bit on bottom.
%H A357148 Michael De Vlieger, Let sequence b list primitive terms in this sequence. <a href="/A357148/a357148.png">Annotated plot a(n) = b(k) at (n, k)</a> for n = 1..84.
%H A357148 Michael De Vlieger, <a href="/A357148/a357148_1.png">Plot a(n) = b(k) at (n, k)</a> for n = 1..2^12.
%H A357148 Scott R. Shannon, <a href="/A357148/a357148_2.png">Image for n = 0..2250000</a>.
%t A357148 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 *)
%o A357148 (Python)
%o A357148 from itertools import islice
%o A357148 def agen():
%o A357148     aset, astr, an, mink = {0}, "0", 0, 1
%o A357148     while True:
%o A357148         k = mink
%o A357148         while k in aset or bin(an+k)[2:] in astr: k += 1
%o A357148         while mink in aset: mink += 1
%o A357148         yield an+k; an = k; aset.add(an); astr += bin(an)[2:]
%o A357148 print(list(islice(agen(), 63))) # _Michael S. Branicky_, Sep 16 2022
%Y A357148 Cf. A357082.
%K A357148 nonn
%O A357148 1,2
%A A357148 _Michael De Vlieger_, Sep 15 2022

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE