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 A194129 #18 Nov 21 2013 12:50:19
%S A194129 1,1,31,48,61,70,78,85,91,96,101,105,108,112,115,118,121,124,126,128,
%T A194129 131,133,135,137,139,140,142,144,145,147,148,150,151,152,154,155,156,
%U A194129 157,158,160,161,162,163,164,165,166,167,168,169,170,170
%N A194129 Number of digits in n^100.
%C A194129 170 is the smallest number (other than 1) appearing more than once in the sequence and 159 is the largest number not appearing in this sequence.
%F A194129 a(n) = 1+A004222(n) = A055642(n^100) - R. J. Mathar, Aug 27 2011
%t A194129 Join[{1},IntegerLength[Range[60]^100]] (* _Harvey P. Dale_, Sep 10 2011 *)
%K A194129 nonn,base
%O A194129 0,3
%A A194129 _Kausthub Gudipati_, Aug 27 2011