|
|
A075306
|
|
Smallest number == 0 mod (n+1)-th prime and == 1 mod all smaller primes.
|
|
4
|
|
|
3, 25, 91, 2101, 23101, 60061, 510511, 29099071, 3792578791, 84106011991, 2005604901301, 252305096583541, 11561510014033981, 52331045326680121, 31359378912013061911, 1792403716245452460151, 98060777857864844592571
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(4) = 2101 == 0 mod 11 and 2101 == 1 mod (2*3*5*7)
|
|
MATHEMATICA
|
Table[ChineseRemainder[PadLeft[{0}, n, 1], Prime[Range[n]]], {n, 2, 20}] (* Harvey P. Dale, Mar 11 2023 *)
|
|
PROG
|
(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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|