login
A063627
Smallest k such that 9^k has exactly n 1's in its decimal representation.
0
1, 2, 6, 17, 16, 21, 51, 46, 42, 50, 65, 60, 81, 64, 101, 89, 107, 179, 130, 158, 167, 194, 191, 164, 149, 197, 192, 202, 257, 227, 245, 244, 253, 304, 264, 296, 306, 321, 292, 302, 295, 314, 335, 346, 334, 450, 388, 406, 359, 394, 428
OFFSET
0,2
MATHEMATICA
a = {}; Do[k = 1; While[ Count[ IntegerDigits[9^k], 1] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
CROSSREFS
Sequence in context: A118305 A139629 A057497 * A069014 A105146 A076660
KEYWORD
base,nonn
AUTHOR
Robert G. Wilson v, Aug 10 2001
EXTENSIONS
Name corrected by Jon E. Schoenfield, Jun 26 2018
STATUS
approved