A343858 - cp's OEIS frontend

A343858 Square array T(m,n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k+2*r+1)/2, r is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists and is determined in A345228, T(m,n) is the smallest number reached in the cyclic trajectory of m = f^j(m). f^j(m) means j times recursion into f(m).

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

[0, 0, 1, 0, 1, 1, 0, 1, 1, 3, 0, 1, 1, 1, 1, 0, 1, 1, 3, 1, 5, 0, 1, 1, 3, 1, 5, 3, 0, 1, 1, 3, 1, 5, 3, 7, 0, 1, 1, 3, 1, 5, 3, 7, 1, 0, 1, 1, 3, 1, 1, 3, 7, 1, 9, 0, 1, 1, 3, 1, 5, 3, 7, 1, 3, 5, 0, 1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 5, 0, 1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 1]

cp's OEIS Frontend

Table of values

List of values

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

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

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