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.

A232559 Sequence (or tree) generated by these rules: 1 is in S, and if x is in S, then x + 1 and 2*x 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 6
6 5
7 8
8 7
9 12
10 10
11 9
12 16
13 14
14 13
15 24
16 11
17 20
18 18
19 17
20 32
21 15
22 28
23 26
24 25
25 48
26 22
27 21
28 40
29 19
30 36
31 34
32 33
33 64
34 30
35 29
36 56
37 27
38 52
39 50
40 49
41 96
42 23
43 44
44 42
45 41
46 80
47 38
48 37
49 72
50 35
51 68
52 66
53 65
54 128
55 31
56 60
57 58
58 57
59 112
60 54
61 53
62 104
63 51
64 100
65 98
66 97

List of values

[1, 2, 3, 4, 6, 5, 8, 7, 12, 10, 9, 16, 14, 13, 24, 11, 20, 18, 17, 32, 15, 28, 26, 25, 48, 22, 21, 40, 19, 36, 34, 33, 64, 30, 29, 56, 27, 52, 50, 49, 96, 23, 44, 42, 41, 80, 38, 37, 72, 35, 68, 66, 65, 128, 31, 60, 58, 57, 112, 54, 53, 104, 51, 100, 98, 97]