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.

A035008 Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.

Table of values

n a(n)
0 0
1 16
2 48
3 96
4 160
5 240
6 336
7 448
8 576
9 720
10 880
11 1056
12 1248
13 1456
14 1680
15 1920
16 2176
17 2448
18 2736
19 3040
20 3360
21 3696
22 4048
23 4416
24 4800
25 5200
26 5616
27 6048
28 6496
29 6960
30 7440
31 7936
32 8448
33 8976
34 9520
35 10080
36 10656
37 11248
38 11856
39 12480
40 13120
41 13776

List of values

[0, 16, 48, 96, 160, 240, 336, 448, 576, 720, 880, 1056, 1248, 1456, 1680, 1920, 2176, 2448, 2736, 3040, 3360, 3696, 4048, 4416, 4800, 5200, 5616, 6048, 6496, 6960, 7440, 7936, 8448, 8976, 9520, 10080, 10656, 11248, 11856, 12480, 13120, 13776]