|
Search: id:A066007
|
|
|
| A066007 |
|
a(n) = that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest. |
|
+0
3
|
|
| 1, 19, 199, 1099, 10999, 109999, 1099999, 10999999, 109999999, 1099999999, 10999999999, 109999999999, 1099999999999, 10999999999999, 100999999999999, 1009999999999999
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
S. W. Golomb, Sums and products of digits, IEEE Information Theory Society Newsletter, 51 (No. 3, Sept. 2001), p. 15.
|
|
FORMULA
|
1 followed by 0's followed by 9's; the first time r 0's appear is at n = (10^r-1)/9+r+2.
|
|
CROSSREFS
|
Cf. A066008, A034726, A034727.
Sequence in context: A097445 A058370 A164890 this_sequence A147830 A135162 A067272
Adjacent sequences: A066004 A066005 A066006 this_sequence A066008 A066009 A066010
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 11 2001
|
|
|
Search completed in 0.002 seconds
|
