A370526 - cp's OEIS frontend

A370526 Square array read by descending antidiagonals: Define function b(i,n,k) where b(0,n,k) = n, b(1,n,k) = k, b(i,n,k) = A038502(b(i-1,n,k) + b(i-2,n,k)). T(n,k) is the number of steps until reaching the cyclic part of {b(i,n,k)}, or -1 if no cycle exists.

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

[0, 0, 0, 12, 0, 4, 3, 24, 13, 7, 6, 0, 14, 0, 1, 11, 12, 11, 5, 5, 18, 17, 12, 23, 0, 15, 4, 3, 2, 4, 19, 2, 8, 5, 1, 1, 17, 3, 4, 24, 0, 13, 12, 7, 5, 4, 11, 14, 10, 27, 23, 10, 19, 14, 5, 4, 6, 10, 0, 11, 14, 9, 0, 12, 1, 4, 14, 13, 11, 10, 22, 10, 29, 15]

cp's OEIS Frontend

A370526 Square array read by descending antidiagonals: Define function b(i,n,k) where b(0,n,k) = n, b(1,n,k) = k, b(i,n,k) = A038502(b(i-1,n,k) + b(i-2,n,k)). T(n,k) is the number of steps until reaching the cyclic part of {b(i,n,k)}, or -1 if no cycle exists.

Table of values

List of values

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

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

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