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.

A180076 a(n+1) = if it exists, smallest number not occurring earlier that is contained in binary representation of a(n), otherwise: a(n+1) = 3*a(n)+1; a(0) = 0.

Table of values

n a(n)
0 0
1 1
2 4
3 2
4 7
5 3
6 10
7 5
8 16
9 8
10 25
11 6
12 19
13 9
14 28
15 12
16 37
17 18
18 55
19 11
20 34
21 17
22 52
23 13
24 40
25 20
26 61
27 14
28 43
29 21
30 64
31 32
32 97
33 24
34 73
35 36
36 109
37 22
38 67
39 33
40 100
41 50
42 151
43 23
44 70
45 35
46 106
47 26
48 79
49 15
50 46
51 139
52 69
53 208
54 80
55 241
56 30
57 91
58 27
59 82
60 41
61 124
62 31
63 94
64 47
65 142
66 71
67 214
68 53
69 160

List of values

[0, 1, 4, 2, 7, 3, 10, 5, 16, 8, 25, 6, 19, 9, 28, 12, 37, 18, 55, 11, 34, 17, 52, 13, 40, 20, 61, 14, 43, 21, 64, 32, 97, 24, 73, 36, 109, 22, 67, 33, 100, 50, 151, 23, 70, 35, 106, 26, 79, 15, 46, 139, 69, 208, 80, 241, 30, 91, 27, 82, 41, 124, 31, 94, 47, 142, 71, 214, 53, 160]