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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216137 a(n) = conjectured number of integers k such that n^k has no two consecutive identical digits. 1

%I #9 Sep 20 2012 17:11:56

%S 40,24,22,23,10,12,14,13,1,8,7,10,10,8,12,8,6,6,1,6,6,9,6,12,8,9,8,10,

%T 1,8,8,6,5,6,5,8,8,5,1,10,5,4,7,8,6,4,6,5,1,6,6,8,7,6,6,6,4,5,1,7,5,5,

%U 8,5,4,4,3,6,1,4,7,5,5,8,3,4,5,7,1,4,6,7,6

%N a(n) = conjectured number of integers k such that n^k has no two consecutive identical digits.

%H T. D. Noe, <a href="/A216137/b216137.txt">Table of n, a(n) for n = 2..1000</a>

%t Table[cnt = 0; Do[If[! MemberQ[Differences[IntegerDigits[n^k]], 0], cnt++], {k, 1000}]; cnt, {n, 2, 100}] (* _T. D. Noe_, Sep 20 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 | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 7 05:42 EDT 2024. Contains 375729 sequences. (Running on oeis4.)