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.

A277367 a(n) = gcd(A006666(n), A006667(n)) where A006666 and A006667 are respectively the number of halving and tripling steps in the '3x+1' problem.

Table of values

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

List of values

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