A071057 Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n.

1, 5, 17, 137, 1817, 20297, 350627, 8518787, 86116307, 5886530927, 193507634597, 6210322338497, 124942132495457, 3471695031294767, 42719979026304857, 3117168891968761907, 850435289298909924887, 91220171746546903961177

Offset: 1

Author

Robert G. Wilson v, May 25 2002

Keywords

• nonn

Crossrefs

Cf. A053664.

Programs

Mathematica

Table[ ChineseRemainder[ Table[ Prime[i + 1], {i, 1, n}], Table[ Prime[i], {i, 1, n}]], {n, 1, 20}]
Table[With[{pr=Prime[Range[n]]},ChineseRemainder[Rest[pr],Most[pr]]],{n,2,20}] (* Harvey P. Dale, Jun 11 2017 *)