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.

A347301 Let S be a set of n distinct integers in the range -n-3 to n+3, and consider the sums s+t of pairs of distinct elements of S; a(n) is the maximum number of such sums that are powers of 2, over all choices for S.

Table of values

n a(n)
1 0
2 1
3 3
4 4
5 5
6 7
7 9
8 11
9 13
10 15
11 17
12 19
13 21
14 24
15 26
16 29
17 31
18 34
19 36
20 39
21 41
22 44
23 46
24 49
25 51
26 54
27 56
28 59
29 61
30 65
31 67
32 71
33 73
34 77
35 79
36 83
37 85
38 89
39 91
40 95
41 97
42 101
43 103
44 107
45 109
46 113
47 115
48 119
49 121
50 125
51 127
52 131
53 133
54 137
55 139
56 143
57 146
58 149
59 152
60 155
61 159
62 162
63 166
64 169
65 173
66 176

List of values

[0, 1, 3, 4, 5, 7, 9, 11, 13, 15, 17, 19, 21, 24, 26, 29, 31, 34, 36, 39, 41, 44, 46, 49, 51, 54, 56, 59, 61, 65, 67, 71, 73, 77, 79, 83, 85, 89, 91, 95, 97, 101, 103, 107, 109, 113, 115, 119, 121, 125, 127, 131, 133, 137, 139, 143, 146, 149, 152, 155, 159, 162, 166, 169, 173, 176]