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.

A337144 n is the a(n)-th positive integer which takes its number of steps to reach 1 in the Collatz (or 3x+1) problem.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 1, 2, 1, 2, 3, 1, 2, 1, 3, 1, 2, 3, 4, 1, 1, 1, 2, 3, 2, 3, 1, 2, 2, 1, 3, 2, 4, 5, 1, 2, 2, 1, 2, 3, 2, 3, 4, 1, 1, 1, 2, 5, 3, 4, 1, 2, 3, 5, 1, 2, 4, 5, 1, 2]