A342731 - cp's OEIS frontend

A342731 a(1)=0; for n >= 2, a(n) is the number of iterations needed for the map (x/y) -> (A000203(x)A000005(y)) / (A000005(x)A000203(y)) to reach a cycle, when starting from x = n. If no cycle is reachable, a(n) = -1.

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

[0, 2, 3, 4, 4, 4, 5, 8, 10, 14, 5, 5, 6, 5, 5, 16, 11, 6, 15, 6, 9, 11, 6, 6, 10, 16, 15, 6, 6, 11, 17, 16, 6, 11, 6, 10, 16, 6, 6, 11, 10, 6, 12, 6, 7, 7, 7, 10, 16, 11, 7, 12, 16, 6, 7, 6, 7, 11, 12, 6, 18, 7, 8, 18, 10, 7, 12, 10, 7, 7, 11, 12, 17, 9, 7, 12]

cp's OEIS Frontend

A342731 a(1)=0; for n >= 2, a(n) is the number of iterations needed for the map (x/y) -> (A000203(x)A000005(y)) / (A000005(x)A000203(y)) to reach a cycle, when starting from x = n. If no cycle is reachable, a(n) = -1.

Table of values

List of values

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

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

cp's OEIS Frontend

A342731 a(1)=0; for n >= 2, a(n) is the number of iterations needed for the map (x/y) -> (A000203(x)*A000005(y)) / (A000005(x)*A000203(y)) to reach a cycle, when starting from x = n. If no cycle is reachable, a(n) = -1.

Table of values

List of values

A342731 a(1)=0; for n >= 2, a(n) is the number of iterations needed for the map (x/y) -> (A000203(x)A000005(y)) / (A000005(x)A000203(y)) to reach a cycle, when starting from x = n. If no cycle is reachable, a(n) = -1.

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