|
|
A063635
|
|
Smallest k such that 9^k has exactly n 9's in its decimal representation.
|
|
0
|
|
|
2, 1, 5, 15, 25, 18, 41, 56, 51, 69, 66, 102, 87, 137, 88, 116, 100, 117, 135, 151, 129, 110, 190, 139, 187, 210, 236, 253, 218, 261, 264, 257, 301, 318, 312, 303, 285, 335, 291, 337, 300, 310, 384, 351, 390, 362, 374, 405, 413, 435, 436
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
MATHEMATICA
|
a = {}; Do[k = 1; While[ Count[ IntegerDigits[9^k], 9] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
Module[{nn=500, tbl}, tbl=Table[{n, DigitCount[9^n, 10, 9]}, {n, nn}]; Table[SelectFirst[ tbl, #[[2]] == k&], {k, 0, 50}]][[All, 1]] (* Harvey P. Dale, Jan 06 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|