A075063 Smallest prime == 1 mod first n composite numbers.

5, 13, 73, 73, 1801, 1801, 2521, 2521, 15121, 15121, 15121, 15121, 55441, 55441, 1108801, 14414401, 43243201, 43243201, 43243201, 43243201, 43243201, 367567201, 367567201, 367567201, 13967553601, 13967553601, 13967553601, 13967553601, 13967553601, 13967553601

Offset

1,1

Links

Table of n, a(n) for n=1..30.

Example

a(5) = 1801 is the smallest prime p such that p-1 is divisible by 360, the least common multiple of first 5 composite numbers 4,6,8,9 and 10.

Prog

(PARI) (with -p10^8): n=1:v=vector(50, k, n=n+1:while(isprime(n), n=n+1):n):n=5:for(k=1, 50, g=0:forprime(p=n, 10^8, f=0:for(l=1, k, if((p%v[l])>1, f=1:break)): if(f==0, n=p:g=1:break)): if(g==1, print1(n", "), print1("-, ")))

Crossrefs

Sequence in context: A382491 A087506 A068487 * A100209 A139361 A115329

Adjacent sequences: A075060 A075061 A075062 * A075064 A075065 A075066

Keyword

nonn

Author

Amarnath Murthy, Sep 08 2002

Extensions

More terms from Ralf Stephan, Mar 20 2003

a(22)-a(30) from Amiram Eldar, Apr 16 2021

Status

approved