A362940 - cp's OEIS frontend

A362940 Consider the Collatz trajectory from n to 1, assuming the Collatz conjecture is true. Then a(n) = number of terms in the trajectory that are greater than 1 and congruent to 1 mod 3. If n never reaches 1, set a(n) = -1.

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

[0, 0, 3, 1, 2, 3, 9, 1, 10, 3, 7, 3, 5, 9, 8, 2, 6, 10, 11, 3, 3, 8, 7, 3, 13, 5, 61, 10, 9, 8, 59, 2, 14, 7, 6, 10, 12, 11, 18, 4, 60, 3, 17, 8, 8, 8, 57, 3, 14, 13, 12, 6, 5, 61, 62, 10, 18, 10, 17, 8, 10, 59, 58, 3, 15, 14, 15, 7, 7, 7, 56, 10, 64, 12, 7, 12]

cp's OEIS Frontend

A362940 Consider the Collatz trajectory from n to 1, assuming the Collatz conjecture is true. Then a(n) = number of terms in the trajectory that are greater than 1 and congruent to 1 mod 3. If n never reaches 1, set a(n) = -1.

Table of values

List of values

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

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

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