|
Search: id:A075063
|
|
|
| A075063 |
|
Smallest prime == 1 mod first n composite numbers. |
|
+0
2
|
|
| 5, 13, 73, 73, 1801, 1801, 2521, 2521, 15121, 15121, 15121, 15121, 55441, 55441, 1108801, 14414401, 43243201, 43243201, 43243201, 43243201, 43243201
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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.
|
|
PROGRAM
|
(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: A093118 A087506 A068487 this_sequence A100209 A139361 A115329
Adjacent sequences: A075060 A075061 A075062 this_sequence A075064 A075065 A075066
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 08 2002
|
|
EXTENSIONS
|
More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 20 2003
a(22) > 10^8.
|
|
|
Search completed in 0.002 seconds
|
