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.

A329633 Triangle read by rows: T(n,k) is the number of self-avoiding paths of length n-1+2*k from NW to SW corners in the n X n grid graph (0 <= k <= A000217(n-1), n >= 1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 5
7 2
8 1
9 6
10 16
11 39
12 61
13 47
14 8
15 1
16 10
17 40
18 125
19 400
20 1048
21 1905
22 2372
23 1839
24 764
25 86
26 1
27 15
28 85
29 335
30 1237
31 4638
32 15860
33 44365
34 99815
35 181995
36 262414
37 285086
38 218011
39 104879
40 26344
41 1770

List of values

[1, 1, 1, 1, 3, 5, 2, 1, 6, 16, 39, 61, 47, 8, 1, 10, 40, 125, 400, 1048, 1905, 2372, 1839, 764, 86, 1, 15, 85, 335, 1237, 4638, 15860, 44365, 99815, 181995, 262414, 285086, 218011, 104879, 26344, 1770]