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!)
A075089 Smallest prime == 1 mod n-th composite number. 2

%I #4 Dec 05 2013 19:55:36

%S 5,7,17,19,11,13,29,31,17,19,41,43,23,73,101,53,109,29,31,97,67,103,

%T 71,37,191,79,41,43,89,181,47,97,197,101,103,53,109,331,113,229,59,61,

%U 311,127,193,131,67,137,139,71,73,149,151,229,463,79,241,163,83,337

%N Smallest prime == 1 mod n-th composite number.

%o (PARI) n=1:v=vector(100,k,n=n+1:while(isprime(n),n=n+1):n):for(l=1,100, forprime(p=2,10000,if((p%v[l])==1,print1(p","):break)))

%K nonn

%O 1,1

%A _Amarnath Murthy_, Sep 13 2002

%E More terms from _Ralf Stephan_, Mar 20 2003

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 April 23 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)