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

 


Smallest prime of the form n*k + 1, where each k may be used in the sequence only once.
1

%I #12 Nov 17 2018 21:10:47

%S 2,5,13,13,31,31,71,73,73,71,199,157,157,197,241,241,409,199,419,401,

%T 547,419,691,409,701,547,919,701,929,691,1117,929,1321,919,1471,1117,

%U 1777,1483,1483,1321,2297,1471,1979,2069,2251,1979,2069,1777,2549,2251

%N Smallest prime of the form n*k + 1, where each k may be used in the sequence only once.

%e a(10) = 10*13 + 1 = 131 though 10*10 + 1 = 101 is also prime but k=10 has already been used by n=7.

%t l = {}; Do[k = 1; While[MemberQ[l, k] || !PrimeQ[n*k + 1], k++ ]; Print[n*k+1]; AppendTo[l, k], {n, 30}] (* _Ryan Propper_, Jun 15 2006 *)

%Y Cf. A087559.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Nov 11 2005

%E Corrected and extended by _Ryan Propper_, Jun 15 2006

%E More terms from _R. J. Mathar_, Aug 20 2007

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 24 02:17 EDT 2024. Contains 376185 sequences. (Running on oeis4.)