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.

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

Table of values

n a(n)
1 4
2 4
3 4
4 4
5 5
6 6
7 7
8 8
9 56
10 72
11 91
12 651
13 651
14 1080
15 1080
16 1443
17 20163
18 20163
19 246962
20 246962
21 246962
22 609843
23 2162162
24 2162162
25 29055601
26 29055601
27 107881202
28 107881202
29 205405203
30 205405203
31 3625549202
32 5675443203
33 8374212002
34 8374212002
35 8374212002
36 8374212002
37 131668891200
38 131668891200

List of values

[4, 4, 4, 4, 5, 6, 7, 8, 56, 72, 91, 651, 651, 1080, 1080, 1443, 20163, 20163, 246962, 246962, 246962, 609843, 2162162, 2162162, 29055601, 29055601, 107881202, 107881202, 205405203, 205405203, 3625549202, 5675443203, 8374212002, 8374212002, 8374212002, 8374212002, 131668891200, 131668891200]

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

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