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.

A304710 Number of partitions of 2n whose Ferrers-Young diagram cannot be tiled with dominoes.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 2
5 6
6 12
7 25
8 46
9 85
10 146
11 250
12 410
13 666
14 1053
15 1648
16 2527
17 3840
18 5747
19 8525
20 12496
21 18172
22 26165
23 37408
24 53038
25 74714
26 104502
27 145315
28 200808
29 276030
30 377339
31 513342
32 694925
33 936590
34 1256670
35 1679310
36 2234994
37 2963430
38 3914701
39 5153434
40 6760937

List of values

[0, 0, 0, 1, 2, 6, 12, 25, 46, 85, 146, 250, 410, 666, 1053, 1648, 2527, 3840, 5747, 8525, 12496, 18172, 26165, 37408, 53038, 74714, 104502, 145315, 200808, 276030, 377339, 513342, 694925, 936590, 1256670, 1679310, 2234994, 2963430, 3914701, 5153434, 6760937]