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.

A052837 Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.

Table of values

n a(n)
0 0
1 0
2 1
3 4
4 10
5 22
6 43
7 80
8 141
9 240
10 397
11 640
12 1011
13 1568
14 2395
15 3604
16 5360
17 7876
18 11460
19 16510
20 23588
21 33418
22 47006
23 65640
24 91085
25 125596
26 172215
27 234820
28 318579
29 430060
30 577920
31 773130
32 1030007
33 1366644
34 1806445
35 2378892
36 3121835
37 4082796
38 5322360
39 6916360

List of values

[0, 0, 1, 4, 10, 22, 43, 80, 141, 240, 397, 640, 1011, 1568, 2395, 3604, 5360, 7876, 11460, 16510, 23588, 33418, 47006, 65640, 91085, 125596, 172215, 234820, 318579, 430060, 577920, 773130, 1030007, 1366644, 1806445, 2378892, 3121835, 4082796, 5322360, 6916360]