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.

A232638 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 4
5 5
6 7
7 6
8 9
9 8
10 13
11 11
12 10
13 17
14 15
15 14
16 25
17 12
18 21
19 19
20 18
21 33
22 16
23 29
24 27
25 26
26 49
27 23
28 22
29 41
30 20
31 37
32 35
33 34
34 65
35 31
36 30
37 57
38 28
39 53
40 51
41 50
42 97
43 24
44 45
45 43
46 42
47 81
48 39
49 38
50 73
51 36
52 69
53 67
54 66
55 129
56 32
57 61
58 59
59 58
60 113
61 55
62 54
63 105
64 52
65 101
66 99

List of values

[1, 2, 3, 4, 5, 7, 6, 9, 8, 13, 11, 10, 17, 15, 14, 25, 12, 21, 19, 18, 33, 16, 29, 27, 26, 49, 23, 22, 41, 20, 37, 35, 34, 65, 31, 30, 57, 28, 53, 51, 50, 97, 24, 45, 43, 42, 81, 39, 38, 73, 36, 69, 67, 66, 129, 32, 61, 59, 58, 113, 55, 54, 105, 52, 101, 99]