A067848 - OEIS

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

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A067848

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

%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