OFFSET
1,2
COMMENTS
Minimum Chinese Remainder Prime Modulus Ladder: for the n-th term, the number modulus a prime equals the previous prime for the first n primes (the initial term is defined to be 1). - Fred Schneider, Oct 21 2007
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..350 (* First 100 terms from T.D. Noe *)
EXAMPLE
a(3)=23 because that is the smallest number such that n==1 (mod 2), n==2 (mod 3) and n == 3 (mod 5).
MAPLE
Primes:= [1, seq(ithprime(i), i=1..30)]:
seq(chrem(Primes[1..k], Primes[2..k+1]), k=1..30); # Robert Israel, Oct 26 2018
MATHEMATICA
Table[ChineseRemainder[Join[{1}, Prime[Range[n-1]]], Prime[Range[n]]], {n, 20}] (* Harvey P. Dale, Mar 30 2018 *)
PROG
(PARI) { a(n) = lift(chinese(vector(n, i, Mod(if(i==1, 1, prime(i-1)), prime(i))))) }; vector(30, n, a(n)) \\ Max Alekseyev, Apr 16 2007
(PARI) my(z=Mod(1, 2)); forprime(x=3, 100, z=chinese(z, Mod(precprime(x-1), x)); print1(lift(z), ", ")); \\ Fred Schneider, Oct 21 2007
CROSSREFS
KEYWORD
nonn
AUTHOR
Christian Bjartli (cbjartli(AT)gmail.com), Apr 14 2007
EXTENSIONS
More terms from Max Alekseyev, Apr 16 2007
Edited by N. J. A. Sloane, May 05 2007
Further edited by N. J. A. Sloane, Jun 30 2008 at the suggestion of R. J. Mathar and Christian Bjartli.
STATUS
approved