# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a216141
Showing 1-1 of 1

%I A216141 #15 Oct 03 2012 15:00:55
%S A216141 477,561,466,950,604,513,466,553,3,492,421,513,931,502,466,985,631,
%T A216141 609,3,529,634,527,412,535,660,553,361,547,3,355,357,439,373,522,604,
%U A216141 399,299,419,4,776,718,636,655,384,686,495,478,442,4,369,565,633,591,472
%N A216141 Conjectured number of digits in highest power of n with no three consecutive identical digits.
%C A216141 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
%H A216141 V. Raman, <a href="/A216141/b216141.txt">Table of n, a(n) for n = 2..99</a>
%Y A216141 Cf. A216063, A216064, A216065.
%K A216141 nonn,base
%O A216141 2,1
%A A216141 _V. Raman_, Sep 01 2012

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE