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.

A304680 Total number of tilings of Ferrers-Young diagrams using dominoes and at most one monomino summed over all partitions of n.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 6
5 23
6 16
7 76
8 42
9 239
10 106
11 688
12 268
13 1931
14 650
15 5266
16 1580
17 13861
18 3750
19 35810
20 8862
21 91065
22 20598
23 226914
24 47776
25 559271
26 109248
27 1360152
28 248966
29 3270429
30 562630
31 7785974
32 1264780
33 18378067
34 2823958
35 43007532
36 6282198
37 99892837
38 13884820

List of values

[1, 1, 2, 6, 6, 23, 16, 76, 42, 239, 106, 688, 268, 1931, 650, 5266, 1580, 13861, 3750, 35810, 8862, 91065, 20598, 226914, 47776, 559271, 109248, 1360152, 248966, 3270429, 562630, 7785974, 1264780, 18378067, 2823958, 43007532, 6282198, 99892837, 13884820]