A242512 - cp's OEIS frontend

A242512 a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.

n	a(n)
0	1
1	1
2	2
3	9
4	32
5	85
6	240
7	588
8	1512
9	3564
10	8700
11	19965
12	47124
13	105963
14	244244
15	540540
16	1224080
17	2674984
18	5974956
19	12924522
20	28553200
21	61250490
22	134104432
23	285689624
24	620826672
25	1314933000
26	2839363800
27	5984393805
28	12852021420
29	26973910215
30	57655813500
31	120569654700
32	256649540640
33	535009931280
34	1134692142540
35	2358818719950
36	4986548028000
37	10340761857030
38	21796919253120
39	45102668144040
40	94821703158000

[1, 1, 2, 9, 32, 85, 240, 588, 1512, 3564, 8700, 19965, 47124, 105963, 244244, 540540, 1224080, 2674984, 5974956, 12924522, 28553200, 61250490, 134104432, 285689624, 620826672, 1314933000, 2839363800, 5984393805, 12852021420, 26973910215, 57655813500, 120569654700, 256649540640, 535009931280, 1134692142540, 2358818719950, 4986548028000, 10340761857030, 21796919253120, 45102668144040, 94821703158000]

cp's OEIS Frontend

A242512 a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.

Table of values

List of values