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.

A352178 Let S = {t_1, t_2, ..., t_n} be a set of n distinct integers and consider the sums t_i + t_j (i 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 6
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

List of values

[0, 1, 3, 4, 6, 7, 9, 11, 13, 15, 17, 19, 21, 24, 26, 29, 31, 34, 36, 39, 41]

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

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