Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057923
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

0,2

EXAMPLE

See example in A051145

CROSSREFS

Cf. A051145, A057924, A057925.

Sequence in context: A161026 A161077 A161293 this_sequence A147763 A098371 A070777

Adjacent sequences: A057920 A057921 A057922 this_sequence A057924 A057925 A057926

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research