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.

A065450 Make an infinite chessboard from the squares in the first quadrant; sequence gives number of squares a knight can reach in n moves starting at the origin.

Table of values

n a(n)
0 1
1 2
2 10
3 22
4 37
5 54
6 76
7 100
8 129
9 160
10 196
11 234
12 277
13 322
14 372
15 424
16 481
17 540
18 604
19 670
20 741
21 814
22 892
23 972
24 1057
25 1144
26 1236
27 1330
28 1429
29 1530
30 1636
31 1744
32 1857
33 1972
34 2092
35 2214
36 2341
37 2470
38 2604
39 2740
40 2881
41 3024
42 3172
43 3322
44 3477
45 3634
46 3796
47 3960

List of values

[1, 2, 10, 22, 37, 54, 76, 100, 129, 160, 196, 234, 277, 322, 372, 424, 481, 540, 604, 670, 741, 814, 892, 972, 1057, 1144, 1236, 1330, 1429, 1530, 1636, 1744, 1857, 1972, 2092, 2214, 2341, 2470, 2604, 2740, 2881, 3024, 3172, 3322, 3477, 3634, 3796, 3960]