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.

A304790 The maximal number of different domino tilings allowed by the Ferrers-Young diagram of a single partition of 2n.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 8
6 13
7 21
8 36
9 55
10 95
11 149
12 281
13 430
14 781
15 1211
16 2245
17 3456
18 6728
19 10092
20 18061
21 31529
22 51378
23 85659
24 167089
25 252748
26 431819
27 817991
28 1292697

List of values

[1, 1, 2, 3, 5, 8, 13, 21, 36, 55, 95, 149, 281, 430, 781, 1211, 2245, 3456, 6728, 10092, 18061, 31529, 51378, 85659, 167089, 252748, 431819, 817991, 1292697]