|
Search: id:A095289
|
|
|
| A095289 |
|
a(n) = the smallest number (in base 10) such that the product of its digits is >= n. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 25, 26, 26, 27, 27, 28, 28, 29, 29, 37, 37, 37, 38, 38, 38, 39, 39, 39, 47, 48, 48, 48, 48, 49, 49, 49, 49, 58, 58, 58, 58, 59, 59, 59, 59, 59, 68, 68, 68, 69, 69, 69, 69, 69, 69, 78, 78, 79, 79, 79, 79, 79, 79, 79, 88, 89, 89, 89, 89, 89, 89, 89, 89
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This seems to be a nondecreasing sequence, at least to 10^5. - Robert G. Wilson v
|
|
REFERENCES
|
ARML 2002, Team event, Question 1
|
|
EXAMPLE
|
a(13) = 27 because 2*7 = 14 >= 13; no number smaller than 27 has this property
|
|
MATHEMATICA
|
f[n_] := Block[{k = n}, While[Times @@ IntegerDigits[k] < n, k++ ]; k]; Table[ f[n], {n, 75}] (from Robert G. Wilson v Jul 05 2004)
|
|
CROSSREFS
|
Cf. A095706.
Sequence in context: A007532 A068189 A069716 this_sequence A095706 A096867 A100753
Adjacent sequences: A095286 A095287 A095288 this_sequence A095290 A095291 A095292
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Sam Handler (sam_5_5_5_0(AT)yahoo.com), Jul 02 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 05 2004
|
|
|
Search completed in 0.002 seconds
|
