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.

A098070 Consider a single king on an infinite chessboard. This sequence gives number of n-move paths when king starting at origin reaches the origin again for the first time at step n.

Table of values

n a(n)
0 1
1 0
2 8
3 24
4 152
5 816
6 5320
7 33840
8 229144
9 1560864
10 10906576
11 76962912
12 550406472
13 3969725856
14 28875757200
15 211436151456
16 1557623566104
17 11533972310976
18 85802992349344
19 640901090847360
20 4804716170926672
21 36138383022850368
22 272621594933332000

List of values

[1, 0, 8, 24, 152, 816, 5320, 33840, 229144, 1560864, 10906576, 76962912, 550406472, 3969725856, 28875757200, 211436151456, 1557623566104, 11533972310976, 85802992349344, 640901090847360, 4804716170926672, 36138383022850368, 272621594933332000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.