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.

A232563 Sequence (or tree) generated by these rules: 1 is in S, and if x is in S, then x + 1 and 4*x 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 8
6 5
7 16
8 12
9 9
10 32
11 6
12 20
13 17
14 64
15 13
16 48
17 10
18 36
19 33
20 128
21 7
22 24
23 21
24 80
25 18
26 68
27 65
28 256
29 14
30 52
31 49
32 192
33 11
34 40
35 37
36 144
37 34
38 132
39 129
40 512
41 28
42 25
43 96
44 22
45 84
46 81
47 320
48 19
49 72
50 69
51 272
52 66
53 260
54 257
55 1024
56 15
57 56
58 53
59 208
60 50
61 196
62 193
63 768

List of values

[1, 2, 4, 3, 8, 5, 16, 12, 9, 32, 6, 20, 17, 64, 13, 48, 10, 36, 33, 128, 7, 24, 21, 80, 18, 68, 65, 256, 14, 52, 49, 192, 11, 40, 37, 144, 34, 132, 129, 512, 28, 25, 96, 22, 84, 81, 320, 19, 72, 69, 272, 66, 260, 257, 1024, 15, 56, 53, 208, 50, 196, 193, 768]