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.

A304789 Number T(n,k) of partitions of 2n whose Ferrers-Young diagram allows exactly k different domino tilings; triangle T(n,k), n>=0, 0<=k<=A304790(n), read by rows.

Table of values

n a(n)
0 0
1 1
2 0
3 2
4 0
5 4
6 1
7 1
8 6
9 2
10 2
11 2
12 10
13 3
14 4
15 1
16 2
17 6
18 14
19 4
20 6
21 4
22 4
23 0
24 2
25 2
26 12
27 22
28 5
29 8
30 7
31 6
32 2
33 4
34 4
35 0
36 0
37 4
38 1
39 2
40 25
41 30
42 6
43 10
44 12
45 10
46 4
47 6
48 6
49 0
50 2
51 8
52 2
53 4
54 0
55 2
56 0
57 0
58 4
59 2
60 0
61 2
62 46
63 44
64 7
65 12
66 17
67 14
68 8
69 8
70 8
71 0
72 4
73 12
74 5
75 6
76 0
77 8
78 2
79 0
80 8
81 4
82 0
83 4
84 0
85 0
86 0
87 2
88 2
89 0
90 0
91 4
92 1
93 2
94 0
95 0
96 2
97 0
98 1

List of values

[0, 1, 0, 2, 0, 4, 1, 1, 6, 2, 2, 2, 10, 3, 4, 1, 2, 6, 14, 4, 6, 4, 4, 0, 2, 2, 12, 22, 5, 8, 7, 6, 2, 4, 4, 0, 0, 4, 1, 2, 25, 30, 6, 10, 12, 10, 4, 6, 6, 0, 2, 8, 2, 4, 0, 2, 0, 0, 4, 2, 0, 2, 46, 44, 7, 12, 17, 14, 8, 8, 8, 0, 4, 12, 5, 6, 0, 8, 2, 0, 8, 4, 0, 4, 0, 0, 0, 2, 2, 0, 0, 4, 1, 2, 0, 0, 2, 0, 1]