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

 


prime(n)+1 divides prime(n^2)+1.
0

%I #4 Feb 11 2014 19:05:27

%S 1,2,3,16,93,947,62627,165517

%N prime(n)+1 divides prime(n^2)+1.

%C a(9) > 3*10^5. [From _Donovan Johnson_, Nov 15 2009]

%e prime(3)+1 = 6, prime(3^2)+1 = 30, so 3 is a term of the sequence.

%t Select[Range[10^5], Mod[Prime[ #^2] + 1, Prime[ # ] + 1] == 0 &]

%K nonn

%O 1,2

%A _Joseph L. Pe_, Feb 14 2002

%E a(7)-a(8) from _Donovan Johnson_, Nov 15 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 21:24 EDT 2024. Contains 376078 sequences. (Running on oeis4.)