A114972 - cp's OEIS frontend

A114972 Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

n	a(n)
0	1
1	1
2	1
3	3
4	1
5	3
6	7
7	2
8	2
9	7
10	19
11	6
12	1
13	6
14	19
15	51
16	16
17	3
18	3
19	16
20	51
21	141
22	45
23	10
24	1
25	10
26	45
27	141
28	393
29	126
30	30
31	4
32	4
33	30
34	126
35	393
36	1107
37	357
38	90
39	15
40	1
41	15
42	90
43	357
44	1107
45	3139
46	1016
47	266
48	50
49	5
50	5
51	50
52	266
53	1016
54	3139
55	8953
56	2907
57	784
58	161
59	21
60	1
61	21
62	161
63	784
64	2907

[1, 1, 1, 3, 1, 3, 7, 2, 2, 7, 19, 6, 1, 6, 19, 51, 16, 3, 3, 16, 51, 141, 45, 10, 1, 10, 45, 141, 393, 126, 30, 4, 4, 30, 126, 393, 1107, 357, 90, 15, 1, 15, 90, 357, 1107, 3139, 1016, 266, 50, 5, 5, 50, 266, 1016, 3139, 8953, 2907, 784, 161, 21, 1, 21, 161, 784, 2907]

cp's OEIS Frontend

A114972 Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).

Table of values

List of values