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.

A383621 a(n) is the minimum possible value of x_1 + x_2 + ... + x_n where x_1, x_2, ..., x_n are positive integers such that x_i does not divide x_j for any i != j.

Table of values

n a(n)
1 1
2 5
3 10
4 17
5 28
6 41
7 55
8 72
9 91
10 111
11 134
12 159
13 187
14 216
15 247
16 282
17 319
18 360
19 403
20 447
21 493
22 540
23 589
24 641
25 694
26 749
27 808
28 869
29 934
30 1001
31 1069
32 1139
33 1210
34 1283
35 1359
36 1436
37 1515
38 1598
39 1683
40 1772
41 1863
42 1955
43 2050
44 2147
45 2245
46 2345
47 2446
48 2549
49 2656
50 2765
51 2878

List of values

[1, 5, 10, 17, 28, 41, 55, 72, 91, 111, 134, 159, 187, 216, 247, 282, 319, 360, 403, 447, 493, 540, 589, 641, 694, 749, 808, 869, 934, 1001, 1069, 1139, 1210, 1283, 1359, 1436, 1515, 1598, 1683, 1772, 1863, 1955, 2050, 2147, 2245, 2345, 2446, 2549, 2656, 2765, 2878]