A120399 - cp's OEIS frontend

A120399 Consider n x n chessboard. This sequence gives number of chess knight paths from left bottom corner of the board to the right top corner with minimal possible path length (shortest paths).

n	a(n)
1	1
2	0
3	2
4	2
5	8
6	4
7	6
8	108
9	40
10	20
11	858
12	252
13	70
14	5596
15	1344
16	252
17	32814
18	6600
19	924
20	179696
21	30888
22	3432
23	937794
24	140140
25	12870
26	4721964
27	622336
28	48620
29	23127208
30	2720952
31	184756
32	110809672
33	11757200
34	705432
35	521527428
36	50338904
37	2704156
38	2418585240
39	213955200

[1, 0, 2, 2, 8, 4, 6, 108, 40, 20, 858, 252, 70, 5596, 1344, 252, 32814, 6600, 924, 179696, 30888, 3432, 937794, 140140, 12870, 4721964, 622336, 48620, 23127208, 2720952, 184756, 110809672, 11757200, 705432, 521527428, 50338904, 2704156, 2418585240, 213955200]

cp's OEIS Frontend

A120399 Consider n x n chessboard. This sequence gives number of chess knight paths from left bottom corner of the board to the right top corner with minimal possible path length (shortest paths).

Table of values

List of values