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.

A174062 Least possible sum of exactly n positive integers less than 2n such that none of the n integers divides another.

Table of values

n a(n)
1 1
2 5
3 10
4 17
5 31
6 42
7 55
8 75
9 92
10 111
11 139
12 162
13 187
14 233
15 262
16 293
17 337
18 372
19 409
20 461
21 502
22 545
23 615
24 662
25 711
26 779
27 832
28 887
29 963
30 1022
31 1083
32 1181
33 1246
34 1313
35 1405
36 1476
37 1549
38 1649
39 1726
40 1805
41 1951
42 2034
43 2119
44 2235
45 2324
46 2415
47 2539
48 2634
49 2731
50 2885

List of values

[1, 5, 10, 17, 31, 42, 55, 75, 92, 111, 139, 162, 187, 233, 262, 293, 337, 372, 409, 461, 502, 545, 615, 662, 711, 779, 832, 887, 963, 1022, 1083, 1181, 1246, 1313, 1405, 1476, 1549, 1649, 1726, 1805, 1951, 2034, 2119, 2235, 2324, 2415, 2539, 2634, 2731, 2885]