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.

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

Table of values

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

List of values

[1, 2, 4, 3, 6, 5, 10, 8, 7, 14, 12, 11, 22, 9, 18, 16, 15, 30, 13, 26, 24, 23, 46, 20, 19, 38, 17, 34, 32, 31, 62, 28, 27, 54, 25, 50, 48, 47, 94, 21, 42, 40, 39, 78, 36, 35, 70, 33, 66, 64, 63, 126, 29, 58, 56, 55, 110, 52, 51, 102, 49, 98, 96, 95, 190, 44]