A242511 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	2
3	6
4	28
5	100
6	330
7	1050
8	3024
9	8736
10	23220
11	62700
12	158004
13	406692
14	986986
15	2452450
16	5788640
17	14002560
18	32357052
19	76640148
20	174174520
21	405623400
22	909582212
23	2089064516
24	4633556448
25	10519464000
26	23120533800
27	51977741400
28	113365499940
29	252725219460
30	547593359850
31	1211884139250
32	2610998927040
33	5741708459520
34	12309472580460
35	26917328938500
36	57457069777800
37	125016198060600
38	265832233972140
39	575824335603660
40	1220234181784800

[1, 1, 2, 6, 28, 100, 330, 1050, 3024, 8736, 23220, 62700, 158004, 406692, 986986, 2452450, 5788640, 14002560, 32357052, 76640148, 174174520, 405623400, 909582212, 2089064516, 4633556448, 10519464000, 23120533800, 51977741400, 113365499940, 252725219460, 547593359850, 1211884139250, 2610998927040, 5741708459520, 12309472580460, 26917328938500, 57457069777800, 125016198060600, 265832233972140, 575824335603660, 1220234181784800]

cp's OEIS Frontend

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

Table of values

List of values