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.

A070858 Smallest prime == 1 mod L, where L = LCM of 1 to n.

Table of values

n a(n)
1 2
2 3
3 7
4 13
5 61
6 61
7 421
8 2521
9 2521
10 2521
11 55441
12 55441
13 4324321
14 4324321
15 4324321
16 4324321
17 85765681
18 85765681
19 232792561
20 232792561
21 232792561
22 232792561
23 10708457761
24 10708457761
25 26771144401
26 26771144401
27 401567166001
28 401567166001
29 18632716502401
30 18632716502401

List of values

[2, 3, 7, 13, 61, 61, 421, 2521, 2521, 2521, 55441, 55441, 4324321, 4324321, 4324321, 4324321, 85765681, 85765681, 232792561, 232792561, 232792561, 232792561, 10708457761, 10708457761, 26771144401, 26771144401, 401567166001, 401567166001, 18632716502401, 18632716502401]