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”).

A057924
Sequence b(n) mentioned in A057923.
3
2, 3, 5, 6, 7, 13, 14, 15, 25, 26, 27, 29, 30, 31, 45, 46, 47, 49, 50, 51, 53, 54, 55, 61, 62, 63, 89, 90, 91, 93, 94, 95, 125, 126, 127, 225, 226, 227, 229, 230, 231, 237, 238, 239, 249, 250, 251, 253, 254, 255, 397, 398, 399, 401, 402, 403, 405, 406, 407, 413, 414
OFFSET
1,1
LINKS
MAPLE
A[0]:= 0: A[1]:= 2: B[1]:= 2:
for n from 2 to 100 do
for k from B[n-1]-A[n-1] do
b:= Bits:-Or(A[n-1], k);
if b > B[n-1] then A[n]:= k; B[n]:= b; break fi
od;
od:
seq(B[n], n=1..100); # Robert Israel, Aug 13 2017
CROSSREFS
Sequence in context: A070274 A088968 A328451 * A103538 A144671 A073721
KEYWORD
easy,nonn
AUTHOR
Larry Reeves (larryr(AT)acm.org), Oct 03 2000
STATUS
approved