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.

A361247 a(n) is the smallest integer k > 2 that satisfies k mod j <= 2 for all integers j in 1..n.

Table of values

n a(n)
1 3
2 3
3 3
4 4
5 5
6 6
7 30
8 42
9 56
10 72
11 792
12 792
13 1080
14 1080
15 1080
16 30240
17 246961
18 246961
19 636482
20 636482
21 1360801
22 2162162
23 2162162
24 2162162
25 39412802
26 39412802
27 107881202
28 107881202
29 3625549202
30 3625549202
31 3625549202
32 170918748001
33 170918748001
34 170918748001
35 170918748001
36 170918748001

List of values

[3, 3, 3, 4, 5, 6, 30, 42, 56, 72, 792, 792, 1080, 1080, 1080, 30240, 246961, 246961, 636482, 636482, 1360801, 2162162, 2162162, 2162162, 39412802, 39412802, 107881202, 107881202, 3625549202, 3625549202, 3625549202, 170918748001, 170918748001, 170918748001, 170918748001, 170918748001]

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

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