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.

A357946 a(n) is the number in the infinite multiplication table that the chess knight reaches in n moves, starting from the number 1, the angle between adjacent segments being 90 degrees alternately changing direction to the left and to the right.

Table of values

n a(n)
0 1
1 6
2 8
3 20
4 21
5 40
6 40
7 66
8 65
9 98
10 96
11 136
12 133
13 180
14 176
15 230
16 225
17 286
18 280
19 348
20 341
21 416
22 408
23 490
24 481
25 570
26 560
27 656
28 645
29 748
30 736
31 846
32 833
33 950
34 936
35 1060
36 1045
37 1176
38 1160
39 1298
40 1281
41 1426
42 1408
43 1560
44 1541
45 1700
46 1680
47 1846
48 1825
49 1998
50 1976

List of values

[1, 6, 8, 20, 21, 40, 40, 66, 65, 98, 96, 136, 133, 180, 176, 230, 225, 286, 280, 348, 341, 416, 408, 490, 481, 570, 560, 656, 645, 748, 736, 846, 833, 950, 936, 1060, 1045, 1176, 1160, 1298, 1281, 1426, 1408, 1560, 1541, 1700, 1680, 1846, 1825, 1998, 1976]