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.

A357409 a(n) is the maximum number of positive numbers in a set of n consecutive positive or negative odd numbers such that the number of pairs that add to a power of 2 is maximal.

Table of values

n a(n)
1 1
2 2
3 3
4 3
5 4
6 5
7 5
8 6
9 6
10 7
11 7
12 8
13 9
14 9
15 10
16 10
17 11
18 11
19 12
20 12
21 13
22 13
23 14
24 14
25 15
26 15
27 17
28 18
29 18
30 19
31 19
32 20
33 20
34 21
35 21
36 22
37 22
38 23
39 23
40 24
41 24
42 25
43 25
44 26
45 26
46 27
47 27
48 28
49 28
50 29
51 29
52 30
53 30
54 31
55 31
56 32
57 33
58 33
59 34
60 34
61 35
62 35
63 36
64 36
65 37
66 37
67 38
68 38
69 39

List of values

[1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 38, 39]

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

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