A345228 - cp's OEIS frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

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

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 3, 0, 0, 2, 2, 0, 2, 3, 1, 0, 2, 3, 0, 1, 2, 10, 0, 2, 1, 3, 0, 0, 1, 7, 3, 2, 1, 3, 4, 0, 7, 0, 4, 2, 17, 1, 3, 5, 4, 0, 6, 7, 1, 1, 4, 10, 3, 0, 4, 5, 0, 5, 6, 22, 0, 7, 7, 24, 4, 1, 2, 5, 0, 4, 5, 19, 7, 2, 4, 17, 3, 4, 2]

cp's OEIS Frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

Table of values

List of values

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

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

cp's OEIS Frontend

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2*n+1)*k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

Table of values

List of values

A345228 Square array T(m, n), read by ascending antidiagonals. Let f(k) = k/2 if k is even, otherwise ((2n+1)k + 2*T(m, n) + 1)/2, T(m, n) is the smallest integer greater than -1, where m = f^j(m) for j > 0 exists. f^j(m) means the j-th iterate of f(m).

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