cp's OEIS Frontend

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.

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

Table of values

n a(n)
1 1
2 5
3 17
4 137
5 1817
6 20297
7 350627
8 8518787
9 86116307
10 5886530927
11 193507634597
12 6210322338497
13 124942132495457
14 3471695031294767
15 42719979026304857
16 3117168891968761907
17 850435289298909924887
18 91220171746546903961177

List of values

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