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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071730 Smallest prime p > prime(n) such that p-prime(n) is a square. 0

%I #7 Mar 30 2012 18:39:02

%S 3,7,41,11,47,17,53,23,59,173,47,41,617,47,83,89,383,97,71,107,89,83,

%T 227,233,101,137,107,251,113,149,131,167,173,239,293,167,173,167,311,

%U 317,503,197,227,197,233,263,227,227,263,233,269,383,257,827,293,587

%N Smallest prime p > prime(n) such that p-prime(n) is a square.

%o (PARI) for(n=1,100,s=n+1; while(frac(sqrt(prime(s)-prime(n)))>0,s++); print1(prime(s),","))

%K easy,nonn

%O 1,1

%A _Benoit Cloitre_, Jun 24 2002

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 July 30 15:31 EDT 2024. Contains 374767 sequences. (Running on oeis4.)