Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026339
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026339 a(n) = least k such that s(k) = n, where s = A026338. +0
1
1, 3, 4, 6, 8, 9, 11, 12, 15, 16, 18, 20, 21, 22, 24, 26, 27, 29, 30, 33, 35, 36, 38, 39, 42, 43, 45, 47, 48, 49, 51, 52, 54, 56, 57, 60, 61, 62, 63, 66, 67, 69, 70, 72, 75, 76, 78, 80, 81, 83, 84, 87, 88, 89, 90, 93, 96, 97, 98, 99, 102, 103 (list; graph; listen)
page 1

Search completed in 0.001 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