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.

A377419 Minimum sum of a maximal subset of {1..n} such that every pair of distinct elements has a different difference.

Table of values

n a(n)
0 0
1 1
2 3
3 3
4 5
5 7
6 7
7 7
8 10
9 10
10 13
11 15
12 15
13 15
14 17
15 17
16 19
17 19
18 23
19 24
20 28
21 29
22 30
23 30
24 33
25 34
26 35
27 36
28 41
29 41
30 46
31 48
32 50
33 52
34 52
35 53
36 56
37 56
38 59
39 59
40 61
41 63
42 65
43 68
44 71
45 71
46 75
47 81
48 83
49 84
50 86
51 87
52 88
53 89
54 90
55 91
56 92
57 93
58 95
59 95
60 98
61 98
62 98
63 105
64 112
65 118
66 121
67 121
68 124

List of values

[0, 1, 3, 3, 5, 7, 7, 7, 10, 10, 13, 15, 15, 15, 17, 17, 19, 19, 23, 24, 28, 29, 30, 30, 33, 34, 35, 36, 41, 41, 46, 48, 50, 52, 52, 53, 56, 56, 59, 59, 61, 63, 65, 68, 71, 71, 75, 81, 83, 84, 86, 87, 88, 89, 90, 91, 92, 93, 95, 95, 98, 98, 98, 105, 112, 118, 121, 121, 124]