A216140 - OEIS

A216140

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

38, 64, 38, 23, 21, 23, 38, 32, 2, 17, 17, 13, 88, 18, 32, 24, 23, 11, 2, 60, 52, 26, 17, 23, 43, 32, 16, 31, 2, 24, 25, 17, 19, 17, 21, 16, 37, 16, 2, 36, 31, 10, 30, 42, 39, 19, 17, 11, 2, 11, 14, 35, 25, 30, 20, 23, 25, 24, 2, 27, 26, 31, 38, 30, 30, 17, 8

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

Number of digits in n^k is equal to A055642(n^k) = floor(1+k*log_10(n)). - V. Raman, Sep 27 2012

LINKS

V. Raman and T. D. Noe, Table of n, a(n) for n = 2..1000 (terms 2 to 99 are from V. Raman)

MATHEMATICA

Table[mx = 0; Do[If[! MemberQ[Differences[d = IntegerDigits[n^k]], 0], mx = Length[d]], {k, 1000}]; mx, {n, 2, 50}] (* T. D. Noe, Oct 01 2012 *)

CROSSREFS

Cf. A216063, A216064, A216065.

Sequence in context: A147616 A193568 A039466 * A177044 A321997 A343974

Adjacent sequences: A216137 A216138 A216139 * A216141 A216142 A216143

KEYWORD

nonn,base

AUTHOR

V. Raman, Sep 01 2012

STATUS

approved