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.

A382398 Number of maximum sized subsets of {1..n} such that every 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 2
6 8
7 22
8 2
9 14
10 40
11 102
12 214
13 4
14 24
15 92
16 236
17 564
18 1148
19 4
20 18
21 90
22 270
23 694
24 1558
25 2
26 6
27 24
28 76
29 252
30 632
31 1554
32 3282
33 6820
34 12942
35 6
36 24
37 84
38 246
39 664
40 1562
41 3442
42 7084
43 14336
44 27202
45 50520
46 2
47 26
48 88
49 294
50 704
51 1716
52 3708
53 8028
54 16108
55 31466
56 58320
57 107136
58 4
59 20
60 54

List of values

[1, 1, 1, 1, 4, 2, 8, 22, 2, 14, 40, 102, 214, 4, 24, 92, 236, 564, 1148, 4, 18, 90, 270, 694, 1558, 2, 6, 24, 76, 252, 632, 1554, 3282, 6820, 12942, 6, 24, 84, 246, 664, 1562, 3442, 7084, 14336, 27202, 50520, 2, 26, 88, 294, 704, 1716, 3708, 8028, 16108, 31466, 58320, 107136, 4, 20, 54]