A242591 - cp's OEIS frontend

A242591 Triangle of number of shortest knight paths T(n,k) from square (0,0) at center of an infinite open chessboard to square (n,k), for 0 <= k <= n.

n	a(n)
0	1
1	12
2	2
3	2
4	1
5	54
6	6
7	2
8	9
9	2
10	2
11	6
12	1
13	3
14	32
15	6
16	28
17	6
18	24
19	3
20	8
21	24
22	3
23	18
24	1
25	12
26	85
27	6
28	100
29	16
30	95
31	12
32	60
33	4
34	25
35	240
36	6
37	70
38	4
39	50
40	1
41	30
42	201
43	10
44	60
45	40
46	330
47	35
48	266
49	20
50	150
51	5
52	66
53	588
54	20
55	210
56	10
57	180
58	5
59	120
60	1
61	60
62	462
63	15
64	147
65	1512

[1, 12, 2, 2, 1, 54, 6, 2, 9, 2, 2, 6, 1, 3, 32, 6, 28, 6, 24, 3, 8, 24, 3, 18, 1, 12, 85, 6, 100, 16, 95, 12, 60, 4, 25, 240, 6, 70, 4, 50, 1, 30, 201, 10, 60, 40, 330, 35, 266, 20, 150, 5, 66, 588, 20, 210, 10, 180, 5, 120, 1, 60, 462, 15, 147, 1512]

cp's OEIS Frontend

A242591 Triangle of number of shortest knight paths T(n,k) from square (0,0) at center of an infinite open chessboard to square (n,k), for 0 <= k <= n.

Table of values

List of values