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.

A347409 Longest run of halving steps in the trajectory from n to 1 in the Collatz map (or 3x+1 problem), or -1 if no such trajectory exists.

Table of values

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

List of values

[0, 1, 4, 2, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 6, 4, 5, 4, 4, 4, 5, 4, 4, 5, 5, 5, 4, 4, 5, 4, 4, 4, 4, 4, 5, 6, 4, 4, 4, 5, 5, 4, 4, 4, 4, 4, 5, 5, 5, 4, 4, 4, 4, 5, 5, 5, 5, 6, 4, 4, 4, 4, 4, 5, 5, 4, 5, 4, 8, 4, 4, 4, 4, 4, 5, 5, 5, 6, 8, 4, 4]