Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026601 a(n) = n-th number k such that s(k) = 1, where s = A026600. +0
3
1, 6, 8, 12, 14, 16, 20, 22, 27, 30, 32, 34, 38, 40, 45, 46, 51, 53, 56, 58, 63, 64, 69, 71, 75, 77, 79, 84, 86, 88, 92, 94, 99, 100, 105, 107, 110, 112, 117, 118, 123, 125, 129, 131, 133, 136, 141, 143, 147, 149, 151, 155, 157, 162 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Equals A079498(n-2) + 1.

Sequence in context: A048586 A080824 A100602 this_sequence A109138 A123303 A063207

Adjacent sequences: A026598 A026599 A026600 this_sequence A026602 A026603 A026604

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research