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.

A290102 Start from the singleton set S = {n}, and generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced a number smaller than n. a(1) = 1 by convention.

Table of values

n a(n)
1 1
2 2
3 9
4 2
5 3
6 2
7 52
8 2
9 3
10 2
11 18
12 2
13 3
14 2
15 49
16 2
17 3
18 2
19 9
20 2
21 3
22 2
23 18
24 2
25 3
26 2
27 395
28 2
29 3
30 2
31 1108
32 2
33 3
34 2
35 9
36 2
37 3
38 2
39 52
40 2
41 3
42 2
43 18
44 2
45 3
46 2
47 360
48 2
49 3
50 2
51 9
52 2
53 3
54 2
55 18
56 2
57 3
58 2
59 57
60 2
61 3
62 2
63 1116
64 2
65 3
66 2
67 9
68 2
69 3
70 2
71 115
72 2
73 3
74 2
75 18
76 2
77 3
78 2
79 109
80 2
81 3
82 2
83 9
84 2
85 3
86 2
87 18
88 2
89 3
90 2
91 56
92 2
93 3
94 2
95 105
96 2
97 3
98 2
99 9
100 2
101 3
102 2
103 368
104 2
105 3
106 2
107 18

List of values

[1, 2, 9, 2, 3, 2, 52, 2, 3, 2, 18, 2, 3, 2, 49, 2, 3, 2, 9, 2, 3, 2, 18, 2, 3, 2, 395, 2, 3, 2, 1108, 2, 3, 2, 9, 2, 3, 2, 52, 2, 3, 2, 18, 2, 3, 2, 360, 2, 3, 2, 9, 2, 3, 2, 18, 2, 3, 2, 57, 2, 3, 2, 1116, 2, 3, 2, 9, 2, 3, 2, 115, 2, 3, 2, 18, 2, 3, 2, 109, 2, 3, 2, 9, 2, 3, 2, 18, 2, 3, 2, 56, 2, 3, 2, 105, 2, 3, 2, 9, 2, 3, 2, 368, 2, 3, 2, 18]