%I A097944
%S A097944 1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,
%T A097944 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U A097944 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N A097944 Number of digits in n-th prime.
%C A097944 For primes p <= n sum(a(n)) -> n/2 and n-> inf.
%e A097944 The first 4 primes are 2,3,5,7. These are 1 digit numbers so the first 
               4 entries in the table are 1's.
%t A097944 a[n_]:=StringLength[ToString[Prime[n]]]; [From Vladimir Orlovsky (4vladimir(AT)gmail.com), 
               Dec 03 2008]
%o A097944 (PARI) g(n) = s=0;forprime(x=2,n,y=length(Str(x));print1(y",");s+=y);
               print();print(s)
%Y A097944 Sequence in context: A069926 A077429 A060417 this_sequence A037203 A032556 
               A110592
%Y A097944 Adjacent sequences: A097941 A097942 A097943 this_sequence A097945 A097946 
               A097947
%K A097944 nonn,base
%O A097944 1,5
%A A097944 Cino Hilliard (hillcino368(AT)gmail.com), Sep 05 2004