Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026408
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026408 a(n) = s(k), where, at the end of stage n when forming A026409, k is the greatest integer such that s(j) > 0 for all j < k. +0
1
1, 2, 2, 3, 5, 4, 5, 6, 7, 8, 6, 8, 11, 14, 13, 11, 13, 11 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A113167 A036014 A076228 this_sequence A036716 A026399 A117267

Adjacent sequences: A026405 A026406 A026407 this_sequence A026409 A026410 A026411

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research