Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026359
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026359 a(n) = least k such that s(k) = n, where s = A026358. +0
1
1, 2, 3, 5, 6, 8, 9, 10, 11, 13, 14, 16, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 32, 33, 35, 36, 38, 39, 40, 41, 43, 44, 46, 47, 49, 50, 52, 53, 54, 55, 57, 58, 60, 61, 62, 63, 65, 66, 68, 69, 70, 71, 73, 74, 76, 77, 78, 79, 81, 82, 84, 85 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A026356 A026357 A026358 this_sequence A026360 A026361 A026362

Sequence in context: A039104 A047450 A039073 this_sequence A032953 A039033 A047333

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research