A320227 - cp's OEIS frontend

A320227 Assuming the truth of the Collatz conjecture, let T(n,i), i = 1..k be the initial k elements of the Collatz trajectory of n, up to when the first 1 appears, but excluding the 1. a(n) is the number of ordered pairs T(n,i) < T(n,j) such that gcd(T(n,i), T(n,j)) = 1.

n	a(n)
1	0
2	0
3	10
4	0
5	4
6	11
7	58
8	0
9	84
10	4
11	40
12	12
13	12
14	62
15	47
16	0
17	25
18	89
19	89
20	4
21	6
22	43
23	36
24	13
25	117
26	13
27	3395
28	66
29	66
30	49
31	3064
32	0
33	148
34	27
35	21
36	94
37	94
38	94
39	286
40	4
41	3246
42	6
43	184
44	46
45	42
46	39
47	2924
48	14
49	122
50	122
51	120
52	14
53	14
54	3435
55	3374
56	70
57	231
58	70
59	247
60	51
61	63
62	3101

[0, 0, 10, 0, 4, 11, 58, 0, 84, 4, 40, 12, 12, 62, 47, 0, 25, 89, 89, 4, 6, 43, 36, 13, 117, 13, 3395, 66, 66, 49, 3064, 0, 148, 27, 21, 94, 94, 94, 286, 4, 3246, 6, 184, 46, 42, 39, 2924, 14, 122, 122, 120, 14, 14, 3435, 3374, 70, 231, 70, 247, 51, 63, 3101]

cp's OEIS Frontend

A320227 Assuming the truth of the Collatz conjecture, let T(n,i), i = 1..k be the initial k elements of the Collatz trajectory of n, up to when the first 1 appears, but excluding the 1. a(n) is the number of ordered pairs T(n,i) < T(n,j) such that gcd(T(n,i), T(n,j)) = 1.

Table of values

List of values