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.

A232640 Sequence (or tree) generated by these rules: 1 is in S, and if x is in S, then x + 1 and 2*x + 1 are in S, and duplicates are deleted as they occur.

Table of values

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

List of values

[1, 2, 3, 5, 4, 7, 6, 11, 9, 8, 15, 13, 12, 23, 10, 19, 17, 16, 31, 14, 27, 25, 24, 47, 21, 20, 39, 18, 35, 33, 32, 63, 29, 28, 55, 26, 51, 49, 48, 95, 22, 43, 41, 40, 79, 37, 36, 71, 34, 67, 65, 64, 127, 30, 59, 57, 56, 111, 53, 52, 103, 50, 99, 97, 96, 191]