Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077491 a(n) = smallest k such that 2k has digit sum = n. +0
2
5, 1, 6, 2, 7, 3, 8, 4, 9, 14, 19, 24, 29, 34, 39, 44, 49, 99, 149, 199, 249, 299, 349, 399, 449, 499, 999, 1499, 1999, 2499, 2999, 3499, 3999, 4499, 4999, 9999, 14999, 19999, 24999, 29999, 34999, 39999, 44999, 49999, 99999, 149999, 199999, 249999, 299999 (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 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research