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.

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

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 4
6 9
7 7
8 18
9 5
10 12
11 10
12 27
13 8
14 21
15 19
16 54
17 15
18 13
19 36
20 11
21 30
22 28
23 81
24 24
25 22
26 63
27 20
28 57
29 55
30 162
31 16
32 45
33 14
34 39
35 37
36 108
37 33
38 31
39 90
40 29
41 84
42 82
43 243
44 25
45 72
46 23
47 66
48 64
49 189
50 60
51 58
52 171
53 56
54 165
55 163
56 486
57 17
58 48
59 46
60 135
61 42
62 40
63 117
64 38

List of values

[1, 2, 3, 6, 4, 9, 7, 18, 5, 12, 10, 27, 8, 21, 19, 54, 15, 13, 36, 11, 30, 28, 81, 24, 22, 63, 20, 57, 55, 162, 16, 45, 14, 39, 37, 108, 33, 31, 90, 29, 84, 82, 243, 25, 72, 23, 66, 64, 189, 60, 58, 171, 56, 165, 163, 486, 17, 48, 46, 135, 42, 40, 117, 38]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.