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.

A337869 The number of random walks on the simple square lattice that return to the origin (0,0) after 2n steps and do not pass through (0,0) or (1,0) at intermediate steps.

Table of values

n a(n)
1 3
2 13
3 106
4 1073
5 12142
6 147090
7 1865772
8 24463905
9 328887346
10 4508608610
11 62781858592
12 885513974674
13 12624162072740
14 181611275997040
15 2633023723495116
16 38431604042148681
17 564258290166041298
18 8327627696761062714
19 123471550301117915892

List of values

[3, 13, 106, 1073, 12142, 147090, 1865772, 24463905, 328887346, 4508608610, 62781858592, 885513974674, 12624162072740, 181611275997040, 2633023723495116, 38431604042148681, 564258290166041298, 8327627696761062714, 123471550301117915892]