|
| |
|
|
A079829
|
|
a(n) = smallest k such that floor[R(k)/k] >= n.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| The complete sequence is now given. Proof (that there is no k such that R(k)/k >= 10): Since R(k) and k have the same number of digits, we see that R(k)/k < 10, else R(k) would have at least one more base-10 digit. - Ryan Propper (rpropper(AT)stanford.edu), Aug 27 2005
|
|
|
EXAMPLE
| a(3)= 15 as floor[51/15] = 3 and 15 is the smallest such number.
|
|
|
MATHEMATICA
| r[n_] := FromDigits[Reverse[IntegerDigits[n]]]; Do[k = 1; While[Floor[r[k]/k] < n, k++ ]; Print[k], {n, 1, 9}] (Propper)
|
|
|
CROSSREFS
| Cf. A079830.
Sequence in context: A120129 A109019 A068893 * A096090 A037286 A166533
Adjacent sequences: A079826 A079827 A079828 * A079830 A079831 A079832
|
|
|
KEYWORD
| base,fini,full,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 11 2003
|
|
|
EXTENSIONS
| More terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 27 2005
|
| |
|
|
