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.

A332862 Array read by antidiagonals: T(m,n) = number of placements of zero or more dominoes on the m X n grid where no two empty squares are horizontally adjacent.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 4
6 3
7 2
8 11
9 9
10 5
11 3
12 25
13 48
14 25
15 8
16 4
17 61
18 172
19 227
20 64
21 13
22 5
23 146
24 731
25 1427
26 1054
27 169
28 21
29 7
30 351
31 2976
32 10388
33 11134
34 4921
35 441
36 34
37 9
38 844
39 12039
40 72751
41 140555
42 88733
43 22944
44 1156
45 55
46 12
47 2028
48 49401
49 510779
50 1693116
51 1932067
52 701926
53 107017
54 3025
55 89

List of values

[1, 1, 2, 2, 4, 3, 2, 11, 9, 5, 3, 25, 48, 25, 8, 4, 61, 172, 227, 64, 13, 5, 146, 731, 1427, 1054, 169, 21, 7, 351, 2976, 10388, 11134, 4921, 441, 34, 9, 844, 12039, 72751, 140555, 88733, 22944, 1156, 55, 12, 2028, 49401, 510779, 1693116, 1932067, 701926, 107017, 3025, 89]