A057925 -id:A057925 - cp's OEIS frontend

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.

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

Offset: 0

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

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

			See example in A051145.

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

Cf. A051145, A057924, A057925.

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

A057924 Sequence b(n) mentioned in A057923.

Original entry on oeis.org

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

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

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

Cf. A057923, A057925.

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

cp's OEIS Frontend

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple