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