|
Search: id:A075306
|
|
|
| A075306 |
|
Smallest number == 0 mod (n+1)-th prime and == 1 mod all smaller primes. |
|
+0
3
|
|
| 3, 25, 91, 2101, 23101, 60061, 510511, 29099071, 3792578791, 84106011991, 2005604901301, 252305096583541, 11561510014033981, 52331045326680121, 31359378912013061911, 1792403716245452460151, 98060777857864844592571
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4) = 2101 == 0 mod 11 and 2101 == 1 mod (2*3*5*7)
|
|
PROGRAM
|
(PARI) for(n=1, 20, p=1:forprime(k=2, prime(n), p=p*k):pn=prime(n+1):s=0:while((s+1)%pn>0, s=s+p):print1(s+1", "))
|
|
CROSSREFS
|
Adjacent sequences: A075303 A075304 A075305 this_sequence A075307 A075308 A075309
Sequence in context: A083222 A041565 A114378 this_sequence A124245 A059457 A095664
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 13 2002
|
|
EXTENSIONS
|
More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 24 2003
|
|
|
Search completed in 0.002 seconds
|
