A075307 Smallest number m > 1 with m == k mod k-th prime for k = 1 to n.

3, 5, 23, 53, 1523, 29243, 299513, 4383593, 188677703, 5765999453, 5765999453, 2211931390883, 165468170356703, 8075975022064163, 361310530977154973, 20037783573808880093, 1779852341342071295513, 40235059344426324076913

Offset

1,1

Comments

Is a(n) == -1 mod 6 for n > 1? - Benoit Cloitre, Sep 17 2002

The answer is yes, since each term after the first must be 1 mod 2 and also 2 mod 3. Every such number is -1 mod 6. - Brian Galebach, Jun 02 2004

Links

Table of n, a(n) for n=1..18.

Example

a(1) = 3 == 1 (mod 2), a(4) = 53 == 1 (mod 2) ==2 (mod 3) ==3 (mod 5) == 4 (mod 7)

Prog

(PARI) a(n)=if(n<0, 0, s=1; while(sum(k=1, n, (s-k)%prime(k))>0, s++); s)

Crossrefs

Identical to A053664 except for first term.

Sequence in context: A065720 A148554 A120937 * A100302 A290384 A023247

Adjacent sequences: A075304 A075305 A075306 * A075308 A075309 A075310

Keyword

nonn

Author

Amarnath Murthy, Sep 13 2002

Extensions

More terms from Benoit Cloitre, Sep 17 2002

More terms from Brian Galebach, Jun 02 2004

More terms from Brian Galebach, Jun 14 2004

Status

approved