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.

A332453 Starting from sigma(n), number of tripling steps to reach 1 in '3x+1' problem, or -1 if 1 is never reached.

Table of values

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

List of values

[0, 2, 0, 5, 2, 2, 0, 5, 2, 6, 2, 5, 5, 2, 2, 39, 6, 11, 1, 1, 0, 6, 2, 5, 39, 1, 1, 5, 5, 6, 0, 39, 2, 41, 2, 33, 6, 5, 5, 4, 1, 2, 4, 1, 11, 6, 2, 39, 10, 4, 6, 7, 41, 5, 6, 5, 1, 4, 5, 1, 39, 2, 2, 15, 1, 6, 3, 39, 2, 6, 6, 43, 6, 10, 39, 3, 2, 1, 1, 4, 34, 39, 1, 5, 41, 8, 5, 4, 4, 5, 5, 1, 0, 6, 5, 39, 7, 45, 11, 7, 7, 41, 2, 12, 2]