The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216140 Conjectured number of digits in highest power of n with no two consecutive identical digits. 1

%I #19 Oct 01 2012 23:37:55

%S 38,64,38,23,21,23,38,32,2,17,17,13,88,18,32,24,23,11,2,60,52,26,17,

%T 23,43,32,16,31,2,24,25,17,19,17,21,16,37,16,2,36,31,10,30,42,39,19,

%U 17,11,2,11,14,35,25,30,20,23,25,24,2,27,26,31,38,30,30,17,8

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

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

%H V. Raman and T. D. Noe, <a href="/A216140/b216140.txt">Table of n, a(n) for n = 2..1000</a> (terms 2 to 99 are from V. Raman)

%t 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 *)

%Y Cf. A216063, A216064, A216065.

%K nonn,base

%O 2,1

%A _V. Raman_, Sep 01 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 13:45 EDT 2024. Contains 376012 sequences. (Running on oeis4.)