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.

A338426 a(n) is the number of paths a chess king can take from (0,0) to (n+1,0) touching each point in {-1,0,1} X {1,2,...,n} exactly once.

Table of values

n a(n)
0 1
1 2
2 28
3 154
4 1206
5 8364
6 60614
7 432636
8 3104484
9 22235310
10 159360540
11 1141875800
12 8182608226
13 58634396372
14 420162632840
15 3010793013534
16 21574706493988
17 154599722419136
18 1107828637412194
19 7938463325113516
20 56885333141857872
21 407628148378295190

List of values

[1, 2, 28, 154, 1206, 8364, 60614, 432636, 3104484, 22235310, 159360540, 1141875800, 8182608226, 58634396372, 420162632840, 3010793013534, 21574706493988, 154599722419136, 1107828637412194, 7938463325113516, 56885333141857872, 407628148378295190]