cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A242513 a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.

Table of values

n a(n)
0 1
1 1
2 2
3 12
4 54
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

List of values

[1, 1, 2, 12, 54, 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]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.