login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057923 a(0)=0, a(1)=2, a(n) = smallest number such that sequence b(n) = {a(n-1) BITWISE OR a(n)} is strictly monotonically increasing. 4
0, 2, 1, 4, 2, 5, 8, 6, 9, 16, 10, 17, 12, 18, 13, 32, 14, 33, 16, 34, 17, 36, 18, 37, 24, 38, 25, 64, 26, 65, 28, 66, 29, 96, 30, 97, 128, 98, 129, 100, 130, 101, 136, 102, 137, 112, 138, 113, 140, 114, 141, 256, 142, 257, 144, 258, 145, 260, 146, 261, 152, 262, 153 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Conjecture: a(n+2) > a(n). - Robert Israel, Aug 13 2017

LINKS

Robert Israel, Table of n, a(n) for n = 0..10000

EXAMPLE

See example in A051145.

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(A[i], i=0..100); # Robert Israel, Aug 13 2017

CROSSREFS

Cf. A051145, A057924, A057925.

Sequence in context: A161077 A161293 A217916 * A147763 A098371 A300234

Adjacent sequences:  A057920 A057921 A057922 * A057924 A057925 A057926

KEYWORD

easy,nonn,look

AUTHOR

Larry Reeves (larryr(AT)acm.org), Oct 03 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 16:43 EDT 2019. Contains 325225 sequences. (Running on oeis4.)