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.

A073605 Smallest number m such that m + k == 0 mod k-th prime for all k from 1 to n.

Table of values

n a(n)
1 1
2 1
3 7
4 157
5 787
6 787
7 210997
8 5316097
9 34415167
10 703693777
11 194794490677
12 5208806743927
13 138782093170507
14 5006786309605867
15 253579251611336437
16 12551374903381164637
17 142908008812141343557
18 77053322014980646906357

List of values

[1, 1, 7, 157, 787, 787, 210997, 5316097, 34415167, 703693777, 194794490677, 5208806743927, 138782093170507, 5006786309605867, 253579251611336437, 12551374903381164637, 142908008812141343557, 77053322014980646906357]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.