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.

A056697 a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.

Table of values

n a(n)
1 2
2 2
3 2
4 3
5 4
6 5
7 29
8 41
9 55
10 71
11 791
12 791
13 1079
14 1079
15 1079
16 30239
17 246960
18 246960
19 636481
20 636481
21 1360800
22 2162161
23 2162161
24 2162161
25 39412801
26 39412801
27 107881201
28 107881201
29 3625549201
30 3625549201
31 3625549201
32 170918748000
33 170918748000
34 170918748000
35 170918748000
36 170918748000
37 2355997644001

List of values

[2, 2, 2, 3, 4, 5, 29, 41, 55, 71, 791, 791, 1079, 1079, 1079, 30239, 246960, 246960, 636481, 636481, 1360800, 2162161, 2162161, 2162161, 39412801, 39412801, 107881201, 107881201, 3625549201, 3625549201, 3625549201, 170918748000, 170918748000, 170918748000, 170918748000, 170918748000, 2355997644001]

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

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