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.
%I A217184 #9 Oct 03 2012 14:39:25
%S A217184 12790,10875,12790,1955,21569,28595,12790,21066,10,9834,12334,18560,
%T A217184 18967,13242,12791,18446,7264,35928,12,3822,22467,19223,6279,1955,
%U A217184 39245,10875,5231,15110,14,6051,12790,13758,36733,4545,21569,17913,20964,9186,15,23833
%N A217184 a(n) is the number of digits in the decimal representation of the smallest power of n that contains nine consecutive identical digits.
%C A217184 Number of digits in n^k is equal to floor(1 + k*log_10(n)).
%H A217184 V. Raman, <a href="/A217184/b217184.txt">Table of n, a(n) for n = 2..100</a>
%t A217184 Table[k = 1; While[d = IntegerDigits[n^k]; ! MemberQ[Partition[Differences[d], 8, 1], {0, 0, 0, 0, 0, 0, 0, 0}], k++]; Length[d], {n, 2, 10}] (* _T. D. Noe_, Oct 03 2012 *)
%Y A217184 Cf. A217164, A217174.
%K A217184 nonn,base
%O A217184 2,1
%A A217184 _V. Raman_, Sep 27 2012