|
%I #20 Jun 16 2019 18:23:43
%S 3,54,569,6500,72717,880415,9616078,105052677,1139295891,12676601300,
%T 135996846047,1450287630358
%N Total number of 3's digits in the first 10^n primes.
%e At a(1)=3 there are 3 3's digits in the first 10^1 primes.
%p A119294 := proc(n) option remember: local k,s,lim: if(n=0)then return 0:fi: lim:=10^n: s:=procname(n-1): for k from 10^(n-1)+1 to lim do s:=s+nops([SearchAll("3",convert(ithprime(k),string))]): od: return s: end: seq(A119294(n),n=1..4); # _Nathaniel Johnston_, May 09 2011
%t Accumulate@Table[Count[IntegerDigits[Prime[Range[10^(n - 1) + 1, 10^n]]], 3, 2], {n, 6}] (* _Robert Price_, Jun 16 2019 *)
%Y Cf. A119290, A119291-A119293, A119295-A119300.
%K nonn,base,more
%O 1,1
%A _Enoch Haga_, May 13 2006
%E Offset changed from 0 to 1 by _Nathaniel Johnston_, May 09 2011
%E a(8)-a(11) from _Robert Price_, Nov 05 2013
%E a(12) from _Marek Hubal_, Mar 04 2019
|
