Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026139
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026139 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026136. Also a(n) = 2*t(n) - 1, where t = A026138. +0
3
1, 3, 7, 9, 15, 19, 21, 25, 27, 33, 39, 43, 45, 51, 55, 57, 61, 63, 69, 73, 75, 79, 81, 87, 93, 97, 99, 105, 111, 115, 117, 123, 127, 129, 133, 135, 141, 147, 151, 153, 159, 163, 165, 169, 171, 177, 181, 183, 187, 189, 195, 201, 205, 207, 213 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A110872 A032424 A026175 this_sequence A119681 A104177 A099204

Adjacent sequences: A026136 A026137 A026138 this_sequence A026140 A026141 A026142

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research