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.

A183048 Sums of least number of knight's moves on boundaries of squares [-n,n]x[-n,n] on infinite chessboard.

Table of values

n a(n)
0 0
1 20
2 32
3 60
4 88
5 140
6 184
7 260
8 312
9 412
10 480
11 596
12 680
13 820
14 912
15 1076
16 1184
17 1364
18 1488
19 1692
20 1824
21 2052
22 2200
23 2444
24 2608
25 2876
26 3048
27 3340
28 3528
29 3836
30 4040
31 4372
32 4584
33 4940
34 5168
35 5540
36 5784
37 6180
38 6432

List of values

[0, 20, 32, 60, 88, 140, 184, 260, 312, 412, 480, 596, 680, 820, 912, 1076, 1184, 1364, 1488, 1692, 1824, 2052, 2200, 2444, 2608, 2876, 3048, 3340, 3528, 3836, 4040, 4372, 4584, 4940, 5168, 5540, 5784, 6180, 6432]