|
|
A063616
|
|
Smallest k >= 0 such that 8^k has exactly n 0's in its decimal representation.
|
|
7
|
|
|
0, 4, 14, 23, 42, 33, 35, 34, 63, 66, 87, 116, 84, 101, 126, 164, 128, 102, 135, 143, 149, 155, 203, 224, 186, 204, 210, 237, 261, 218, 219, 286, 257, 266, 361, 355, 336, 302, 374, 339, 371, 398, 340, 409, 348, 388, 494, 436, 407, 406, 439
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
MATHEMATICA
|
a = {}; Do[k = 0; While[ Count[ IntegerDigits[8^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
|
|
PROG
|
(PARI) A063616(n)=for(k=0, oo, #select(d->!d, digits(8^k))==n&&return(k)) \\ M. F. Hasler, Jun 14 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|