login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331698 a(n) = (1/2) * ((greatest prime < (n+1)^2) - (least prime > n^2)) for n >= 2. 1
1, 1, 3, 1, 5, 4, 6, 7, 6, 6, 9, 10, 13, 12, 13, 12, 14, 15, 19, 18, 18, 15, 21, 21, 25, 20, 26, 17, 23, 27, 28, 31, 30, 31, 35, 33, 32, 37, 34, 33, 35, 36, 34, 43, 39, 42, 45, 33, 45, 45, 48, 45, 53, 42, 46, 55, 49, 51, 56, 53, 60, 52, 60, 60, 63, 64, 61, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Hugo Pfoertner, Table of n, a(n) for n = 2..10000

EXAMPLE

a(2) = 1 because 7 is the greatest prime < 3^2 and 5 is the least prime > 2^2. (7-5)/2 = 1.

PROG

(PARI) for(n=2, 69, print1((precprime((n+1)^2)-nextprime(n^2))/2, ", "))

CROSSREFS

Cf. A007491, A053001, A132657.

Sequence in context: A154947 A152747 A010847 * A082129 A159970 A096374

Adjacent sequences:  A331695 A331696 A331697 * A331699 A331700 A331701

KEYWORD

nonn

AUTHOR

Hugo Pfoertner, Jan 27 2020

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 11:38 EDT 2020. Contains 337318 sequences. (Running on oeis4.)