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.

A376837 a(n) is the number of paths to reach a position outside an 8 X 8 chessboard after n steps, starting in one of the corners, when performing a walk with unit steps on the square lattice.

Table of values

n a(n)
1 2
2 2
3 6
4 12
5 40
6 100
7 350
8 982
9 3542
10 10738
11 39556
12 127272
13 475332
14 1602458
15 6030830
16 21056830
17 79514918
18 284645860
19 1075801928
20 3917238476
21 14799350958
22 54498514998
23 205721183302
24 763140403282
25 2878050335900
26 10726898070952
27 40421307665420
28 151112554663930
29 569043610134622
30 2131459901180670

List of values

[2, 2, 6, 12, 40, 100, 350, 982, 3542, 10738, 39556, 127272, 475332, 1602458, 6030830, 21056830, 79514918, 284645860, 1075801928, 3917238476, 14799350958, 54498514998, 205721183302, 763140403282, 2878050335900, 10726898070952, 40421307665420, 151112554663930, 569043610134622, 2131459901180670]