The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256468 Number of primes between prime(n)^2 and prime(n)*prime(n+1). 6
 1, 2, 2, 6, 4, 8, 5, 12, 22, 8, 27, 21, 11, 23, 38, 36, 16, 43, 31, 15, 52, 36, 52, 75, 45, 22, 42, 19, 48, 160, 47, 81, 22, 141, 26, 90, 89, 65, 102, 96, 40, 180, 40, 73, 38, 227, 227, 85, 44, 85, 129, 43, 216, 133, 140, 137, 45, 147, 105, 46, 260, 354, 115, 52, 108, 386, 165, 283, 64 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..6542 A. Karttunen, Ratio a(n)/A256469(n) plotted with OEIS Plot2-script A. Karttunen, Ratio a(n)/A050216(n) plotted with OEIS Plot2-script FORMULA a(n) = A256447(n)-1. a(n) = A050216(n) - A256469(n). a(n) = A256469(n) - A256470(n). MATHEMATICA Table[Abs@ Subtract[PrimePi[Prime[n]^2], PrimePi[Prime[n] Prime[n + 1]]], {n, 69}] (* Michael De Vlieger, Mar 30 2015 *) PROG (PARI) allocatemem(234567890); default(primelimit, 4294965247); A256468(n) = (primepi(prime(n)*prime(n+1)) - primepi(prime(n)^2)); for(n=1, 6542, write("b256468.txt", n, " ", A256468(n))); (Scheme) (define (A256468 n) (let* ((p (A000040 n)) (p2 (* p p))) (let loop ((s 0) (k (* p (A000040 (+ 1 n))))) (cond ((= k p2) s) (else (loop (+ s (if (prime? k) 1 0)) (- k 1))))))) CROSSREFS One less than A256447. Cf. A050216, A256469, A256470. Sequence in context: A074911 A174222 A071059 * A061108 A284918 A053213 Adjacent sequences: A256465 A256466 A256467 * A256469 A256470 A256471 KEYWORD nonn AUTHOR Antti Karttunen, Mar 30 2015 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 September 21 02:47 EDT 2023. Contains 365486 sequences. (Running on oeis4.)