|
%I #4 Aug 14 2017 03:11:10
%S 2,3,5,6,7,13,14,15,25,26,27,29,30,31,45,46,47,49,50,51,53,54,55,61,
%T 62,63,89,90,91,93,94,95,125,126,127,225,226,227,229,230,231,237,238,
%U 239,249,250,251,253,254,255,397,398,399,401,402,403,405,406,407,413,414
%N Sequence b(n) mentioned in A057923.
%H Robert Israel, <a href="/A057924/b057924.txt">Table of n, a(n) for n = 1..10000</a>
%p A[0]:= 0: A[1]:= 2: B[1]:= 2:
%p for n from 2 to 100 do
%p for k from B[n-1]-A[n-1] do
%p b:= Bits:-Or(A[n-1],k);
%p if b > B[n-1] then A[n]:= k; B[n]:= b; break fi
%p od;
%p od:
%p seq(B[n],n=1..100); # _Robert Israel_, Aug 13 2017
%Y Cf. A057923, A057925.
%K easy,nonn
%O 1,1
%A Larry Reeves (larryr(AT)acm.org), Oct 03 2000
|
