login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A071057
Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n.
1
1, 5, 17, 137, 1817, 20297, 350627, 8518787, 86116307, 5886530927, 193507634597, 6210322338497, 124942132495457, 3471695031294767, 42719979026304857, 3117168891968761907, 850435289298909924887, 91220171746546903961177
OFFSET
1,2
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 *)
CROSSREFS
Cf. A053664.
Sequence in context: A249520 A248661 A176133 * A181922 A177509 A160611
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, May 25 2002
STATUS
approved