This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A166724 a(n) = PrimePi(A166546(n)). 3

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 22 18:03 EST 2019. Contains 320400 sequences. (Running on oeis4.)