login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A216142
Conjectured number of digits in highest power of n with no four consecutive identical digits.
0
10797, 9347, 10797, 9858, 7550, 8503, 8031, 9347, 4, 7175, 8708, 9739, 7391, 7707, 10797, 5653, 8536, 8530, 4, 6438, 6795, 7674, 8283, 5290, 9127, 9347, 6702, 7210, 5, 7125, 7446, 10462, 7508, 8061, 7550, 6706, 5184, 7226, 5, 5934, 8607, 8624, 8663, 5484
OFFSET
2,1
COMMENTS
The number of decimal digits in n^k is equal to A055642(n^k) = floor(1+k*log_10(n)). - V. Raman, Sep 27 2012
CROSSREFS
KEYWORD
nonn,base
AUTHOR
V. Raman, Sep 01 2012
STATUS
approved