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.

A329118 Array read by antidiagonals: T(m, n) is the number of simple paths from corner to diagonally opposite corner on an m X n grid with king moves allowed.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 1
7 1
8 24
9 24
10 1
11 1
12 116
13 235
14 116
15 1
16 1
17 560
18 2922
19 2922
20 560
21 1
22 1
23 2704
24 38169
25 96371
26 38169
27 2704
28 1
29 1
30 13056
31 494596
32 3764367
33 3764367
34 494596
35 13056
36 1
37 1
38 63040
39 6375379
40 150610151
41 447544629
42 150610151
43 6375379
44 63040
45 1
46 1
47 304384
48 82191766
49 5898799685
50 56182569218
51 56182569218
52 5898799685
53 82191766
54 304384
55 1

List of values

[1, 1, 1, 1, 5, 1, 1, 24, 24, 1, 1, 116, 235, 116, 1, 1, 560, 2922, 2922, 560, 1, 1, 2704, 38169, 96371, 38169, 2704, 1, 1, 13056, 494596, 3764367, 3764367, 494596, 13056, 1, 1, 63040, 6375379, 150610151, 447544629, 150610151, 6375379, 63040, 1, 1, 304384, 82191766, 5898799685, 56182569218, 56182569218, 5898799685, 82191766, 304384, 1]