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.

A346971 Smallest c which can be split into positive parts a and b with a+b=c, such that the divisors of a,b,c cover all numbers up to n.

Table of values

n a(n)
2 2
3 3
4 4
5 8
6 10
7 12
8 24
9 45
10 54
11 88
12 120
13 182
14 182
15 360
16 540
17 1326
18 1326
19 3990
20 5040
21 5040
22 5040
23 9282
24 9282
25 25200
26 25200
27 65208
28 65208
29 118800
30 118800
31 651456
32 651456
33 651456
34 651456
35 651456
36 651456
37 2314200
38 2314200
39 2314200
40 2314200
41 16365396
42 16365396

List of values

[2, 3, 4, 8, 10, 12, 24, 45, 54, 88, 120, 182, 182, 360, 540, 1326, 1326, 3990, 5040, 5040, 5040, 9282, 9282, 25200, 25200, 65208, 65208, 118800, 118800, 651456, 651456, 651456, 651456, 651456, 651456, 2314200, 2314200, 2314200, 2314200, 16365396, 16365396]