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.

A325878 Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 5
6 8
7 22
8 40
9 56
10 78
11 124
12 222
13 390
14 616
15 892
16 1220
17 1620
18 2182
19 3042
20 4392
21 6364
22 9054
23 12608
24 16980
25 22244
26 28482
27 36208
28 45864
29 58692
30 75804
31 98440
32 128694
33 168250
34 218558
35 281210
36 357594
37 449402
38 560034
39 693332
40 853546
41 1050118
42 1293458
43 1596144
44 1975394

List of values

[1, 1, 1, 1, 4, 5, 8, 22, 40, 56, 78, 124, 222, 390, 616, 892, 1220, 1620, 2182, 3042, 4392, 6364, 9054, 12608, 16980, 22244, 28482, 36208, 45864, 58692, 75804, 98440, 128694, 168250, 218558, 281210, 357594, 449402, 560034, 693332, 853546, 1050118, 1293458, 1596144, 1975394]

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

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