|
%I #5 Jan 19 2019 20:25:44
%S 0,1,2,3,3,4,4,4,5,5,6,6,6,7,7,8,8,8,8,9,9,9,9,10,11,11,11,11,11,12,
%T 12,12,13,14,14,14,14,15,15,15,15,15,16,16,16,16,17,17,18,18,18,18,19,
%U 19,19,20,20,21,21,21,21,21,22,22,22,23,23,23,23,23,24,24,24,24,24,24,24
%N a(n) = PrimePi(A166546(n)).
%p A166546 := proc(n) option remember; local a; if n = 1 then 1; else for a from procname(n-1)+1 do if isprime(1+numtheory[tau](a)) then return a; end if; end do ; end if; end proc: A166724 := proc(n) numtheory[pi](A166546(n)) ; end proc: seq(A166724(n),n=1..80) ; # _R. J. Mathar_, Jan 30 2010
%Y Cf. A166546.
%K easy,nonn
%O 1,3
%A _Giovanni Teofilatto_, Oct 20 2009
%E Corrected (one 14 inserted) by _R. J. Mathar_, Jan 30 2010
|
