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.

A053664 Smallest number m such that m == i (mod prime(i)) for all 1<=i<=n.

Table of values

n a(n)
1 1
2 5
3 23
4 53
5 1523
6 29243
7 299513
8 4383593
9 188677703
10 5765999453
11 5765999453
12 2211931390883
13 165468170356703
14 8075975022064163
15 361310530977154973
16 20037783573808880093
17 1779852341342071295513
18 40235059344426324076913

List of values

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