|
Search: id:A075064
|
|
|
| A075064 |
|
Smallest composite number == 1 mod first n prime numbers. |
|
+0
1
|
|
| 9, 25, 91, 841, 6931, 30031, 510511, 9699691, 223092871, 6469693231, 601681470391, 7420738134811, 304250263527211, 13082761331670031, 614889782588491411, 32589158477190044731, 1922760350154212639071
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Matthew M. Conroy, Home page (listed instead of email address)
|
|
EXAMPLE
|
a(5) = 6931 is the smallest composite number c such that c-1= 6930 is divisible by 2310, the product of first 5 prime numbers 2,3,5,7 and 11.
|
|
PROGRAM
|
(PARI) g(n) = prod(i=1, n, prime(i)); k(n) = m=1; while(isprime(m*g(n)+1), m=m+1); print(m*g(n)+1); for(i=1, 30, k(i))
|
|
CROSSREFS
|
Cf. A075063.
Sequence in context: A110970 A066137 A075067 this_sequence A083672 A083100 A084058
Adjacent sequences: A075061 A075062 A075063 this_sequence A075065 A075066 A075067
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 08 2002
|
|
EXTENSIONS
|
More terms from Matthew M. Conroy, Sep 10 2002
|
|
|
Search completed in 0.002 seconds
|
