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.

A346775 Starting from n!+1, the length of the longest sequence of consecutive numbers which all take the same number of steps to reach 1 in the Collatz (or '3x+1') problem.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 3, 5, 1, 7, 1, 1, 3, 1, 3, 1, 1, 1, 30, 1, 30, 3, 7, 1, 3, 3, 7, 1, 1, 7, 15, 3, 1, 1, 3, 15, 26, 15, 1, 1, 1, 1, 7, 7, 26, 7, 1, 7, 3, 1, 1, 3, 1, 7, 3, 7, 1, 1, 26, 15, 7, 30, 1, 1, 1, 1, 3, 15, 3, 1, 1, 31, 648, 26, 26, 30, 90, 1, 1, 3, 15]