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.

A060833 Separate the natural numbers into disjoint sets A, B with 1 in A, such that the sum of any 2 distinct elements of the same set never equals 2^k + 2. Sequence gives elements of set A.

Table of values

n a(n)
1 1
2 4
3 7
4 8
5 12
6 13
7 15
8 16
9 20
10 23
11 24
12 25
13 28
14 29
15 31
16 32
17 36
18 39
19 40
20 44
21 45
22 47
23 48
24 49
25 52
26 55
27 56
28 57
29 60
30 61
31 63
32 64
33 68
34 71
35 72
36 76
37 77
38 79
39 80
40 84
41 87
42 88
43 89
44 92
45 93
46 95
47 96
48 97
49 100
50 103
51 104
52 108
53 109
54 111
55 112
56 113
57 116
58 119
59 120
60 121
61 124
62 125
63 127
64 128

List of values

[1, 4, 7, 8, 12, 13, 15, 16, 20, 23, 24, 25, 28, 29, 31, 32, 36, 39, 40, 44, 45, 47, 48, 49, 52, 55, 56, 57, 60, 61, 63, 64, 68, 71, 72, 76, 77, 79, 80, 84, 87, 88, 89, 92, 93, 95, 96, 97, 100, 103, 104, 108, 109, 111, 112, 113, 116, 119, 120, 121, 124, 125, 127, 128]