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.

A304718 Number T(n,k) of domino tilings of Ferrers-Young diagrams of partitions of 2n using exactly k horizontally oriented dominoes; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 2
6 3
7 5
8 5
9 3
10 5
11 9
12 14
13 9
14 5
15 7
16 18
17 28
18 28
19 18
20 7
21 11
22 29
23 63
24 62
25 63
26 29
27 11
28 15
29 51
30 109
31 150
32 150
33 109
34 51
35 15
36 22
37 79
38 206
39 293
40 380
41 293
42 206
43 79
44 22
45 30
46 126
47 342
48 590
49 787
50 787
51 590
52 342
53 126
54 30
55 42
56 189
57 584
58 1061
59 1675
60 1760
61 1675
62 1061
63 584
64 189
65 42

List of values

[1, 1, 1, 2, 2, 2, 3, 5, 5, 3, 5, 9, 14, 9, 5, 7, 18, 28, 28, 18, 7, 11, 29, 63, 62, 63, 29, 11, 15, 51, 109, 150, 150, 109, 51, 15, 22, 79, 206, 293, 380, 293, 206, 79, 22, 30, 126, 342, 590, 787, 787, 590, 342, 126, 30, 42, 189, 584, 1061, 1675, 1760, 1675, 1061, 584, 189, 42]