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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037210 Numbers n such that p-n=p#-n#, where p=nextprime(n), n#=nextprime(square root of n), p#=nextprime(square root of p). 0
2207, 5327, 7919, 12767, 27887, 39595, 44519, 54287, 139127, 160799, 253007, 299203, 332923, 351647, 368447, 383159, 458327, 502677, 597525, 619363, 863039, 908199, 966285, 994001, 1079517, 1247687, 1261127, 1442399, 1530161, 1559997 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..30.

MATHEMATICA

npQ[n_]:=Module[{p=NextPrime[n], p1, n1=NextPrime[Sqrt[n]]}, p1= NextPrime[ Sqrt[p]]; p-n==p1-n1]; Select[Range[156*10^4], npQ] (* Harvey P. Dale, Dec 19 2021 *)

CROSSREFS

Sequence in context: A004931 A004951 A004971 * A114360 A023319 A207793

Adjacent sequences: A037207 A037208 A037209 * A037211 A037212 A037213

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 14:22 EST 2022. Contains 358362 sequences. (Running on oeis4.)