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.

A038522 On a (2n+1) X (2n+1) board, let m(i) be the number of squares that are i knight's moves from center; sequence gives max m(i) for i >= 0.

Table of values

n a(n)
0 1
1 1
2 8
3 20
4 32
5 52
6 68
7 76
8 96
9 96
10 120
11 120
12 148
13 148
14 176
15 176
16 204
17 204
18 232
19 232
20 260
21 260
22 288
23 288
24 316
25 316
26 344
27 344
28 372
29 372
30 400
31 400
32 428
33 428
34 456
35 456
36 484
37 484
38 512
39 512
40 540
41 540
42 568
43 568
44 596
45 596
46 624
47 624
48 652
49 652
50 680
51 680
52 708
53 708

List of values

[1, 1, 8, 20, 32, 52, 68, 76, 96, 96, 120, 120, 148, 148, 176, 176, 204, 204, 232, 232, 260, 260, 288, 288, 316, 316, 344, 344, 372, 372, 400, 400, 428, 428, 456, 456, 484, 484, 512, 512, 540, 540, 568, 568, 596, 596, 624, 624, 652, 652, 680, 680, 708, 708]

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

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