Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057926
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057926 a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing. +0
3
1, 3, 4, 8, 5, 10, 16, 11, 20, 32, 21, 34, 24, 35, 28, 64, 29, 66, 32, 67, 36, 72, 37, 74, 48, 75, 52, 128, 53, 130, 56, 131, 60, 192, 61, 194, 256, 195, 260, 200, 261, 202, 272, 203, 276, 224, 277, 226, 280, 227, 284, 512, 285, 514, 288, 515, 292, 520, 293, 522, 304 (list; graph; listen)
OFFSET

0,2

EXAMPLE

See example in A051145.

CROSSREFS

Cf. A051145, A057927, A057928.

Sequence in context: A127122 A086850 A050274 this_sequence A078766 A050417 A074212

Adjacent sequences: A057923 A057924 A057925 this_sequence A057927 A057928 A057929

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research