The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A166678 a(n) = pi((sqrt(P(n))+1)^2) - pi(P(n)), where pi(n) = number of primes <= n and P(n) = n-th primorial. 0
 2, 2, 3, 6, 14, 34, 110, 384, 1540, 7019, 34501, 183439, 1045196, 6164423, 38285946 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: pi((sqrt(P(n))+1)^2) - pi(P(n)) >= n. LINKS Table of n, a(n) for n=1..15. MATHEMATICA a[n_] := Product[Prime[k], {k, 1, n}]; Table[PrimePi[(Sqrt[a[n]] + 1)^2] - PrimePi[a[n]], {n, 1, 12}] (* G. C. Greubel, May 22 2016 *) PROG (PARI) a(n) = my(P=vecprod(primes(n))); primepi((sqrt(P)+1)^2) - primepi(P); \\ Michel Marcus, Aug 15 2022 CROSSREFS Cf. A000720 (pi), A002110 (primorials), A000849 (pi(primorials)). Sequence in context: A064674 A095902 A103687 * A032908 A192366 A318039 Adjacent sequences: A166675 A166676 A166677 * A166679 A166680 A166681 KEYWORD nonn,more,less AUTHOR Daniel Tisdale, Oct 18 2009, Oct 23 2009 EXTENSIONS a(13)-a(15) from Ray Chandler, May 10 2010 Name edited by Michel Marcus, Aug 15 2022 STATUS approved

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

Last modified May 23 00:54 EDT 2024. Contains 372758 sequences. (Running on oeis4.)