A114929 - cp's OEIS frontend

A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; 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	2
4	1
5	2
6	4
7	2
8	2
9	4
10	9
11	5
12	1
13	5
14	9
15	21
16	12
17	3
18	3
19	12
20	21
21	51
22	30
23	9
24	1
25	9
26	30
27	51
28	127
29	76
30	25
31	4
32	4
33	25
34	76
35	127
36	323
37	196
38	69
39	14
40	1
41	14
42	69
43	196
44	323
45	835
46	512
47	189
48	44
49	5
50	5
51	44
52	189
53	512
54	835
55	2188
56	1353
57	518
58	133
59	20
60	1
61	20
62	133
63	518
64	1353
65	2188
66	5798
67	3610
68	1422

[1, 1, 1, 2, 1, 2, 4, 2, 2, 4, 9, 5, 1, 5, 9, 21, 12, 3, 3, 12, 21, 51, 30, 9, 1, 9, 30, 51, 127, 76, 25, 4, 4, 25, 76, 127, 323, 196, 69, 14, 1, 14, 69, 196, 323, 835, 512, 189, 44, 5, 5, 44, 189, 512, 835, 2188, 1353, 518, 133, 20, 1, 20, 133, 518, 1353, 2188, 5798, 3610, 1422]

cp's OEIS Frontend

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

Table of values

List of values