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.

A277109 Starting from 2^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 1
8 3
9 1
10 3
11 1
12 1
13 1
14 3
15 1
16 3
17 7
18 15
19 30
20 1
21 1
22 3
23 7
24 15
25 26
26 26
27 1
28 1
29 1
30 3
31 1
32 3
33 1
34 3
35 1
36 1
37 1
38 3
39 1
40 3
41 7
42 15
43 1
44 1
45 1
46 3
47 1
48 3
49 1
50 3
51 1
52 1
53 1
54 3
55 1
56 3
57 7
58 15
59 1
60 1
61 3
62 7
63 15
64 26
65 1
66 3
67 7
68 15
69 31
70 63
71 26
72 30
73 26
74 26
75 26
76 26
77 30
78 46
79 26
80 26
81 26
82 26
83 1
84 1
85 1
86 3
87 7
88 15
89 1
90 3
91 1

List of values

[1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 7, 15, 30, 1, 1, 3, 7, 15, 26, 26, 1, 1, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 7, 15, 1, 1, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 7, 15, 1, 1, 3, 7, 15, 26, 1, 3, 7, 15, 31, 63, 26, 30, 26, 26, 26, 26, 30, 46, 26, 26, 26, 26, 1, 1, 1, 3, 7, 15, 1, 3, 1]