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.

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

Table of values

n a(n)
1 2
2 2
3 3
4 4
5 16
6 25
7 36
8 120
9 505
10 721
11 2520
12 2520
13 41041
14 83161
15 83161
16 196560
17 524161
18 524161
19 3160080
20 3160080
21 3160080
22 3160080
23 68468401
24 68468401
25 68468401
26 68468401
27 4724319601
28 4724319601
29 26702676000
30 26702676000

List of values

[2, 2, 3, 4, 16, 25, 36, 120, 505, 721, 2520, 2520, 41041, 83161, 83161, 196560, 524161, 524161, 3160080, 3160080, 3160080, 3160080, 68468401, 68468401, 68468401, 68468401, 4724319601, 4724319601, 26702676000, 26702676000]

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

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