cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A216142 Conjectured number of digits in highest power of n with no four consecutive identical digits.

Original entry on oeis.org

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

Views

Author

V. Raman, Sep 01 2012

Keywords

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