This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A071057 #4 Jun 11 2017 08:19:44
%S A071057 1,5,17,137,1817,20297,350627,8518787,86116307,5886530927,
%T A071057 193507634597,6210322338497,124942132495457,3471695031294767,
%U A071057 42719979026304857,3117168891968761907,850435289298909924887,91220171746546903961177
%N A071057 Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n.
%t A071057 Table[ ChineseRemainder[ Table[ Prime[i + 1], {i, 1, n}], Table[ Prime[i], {i, 1, n}]], {n, 1, 20}]
%t A071057 Table[With[{pr=Prime[Range[n]]},ChineseRemainder[Rest[pr],Most[pr]]],{n,2,20}] (* _Harvey P. Dale_, Jun 11 2017 *)
%Y A071057 Cf. A053664.
%K A071057 nonn
%O A071057 1,2
%A A071057 _Robert G. Wilson v_, May 25 2002