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.

A063075 Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box and cover an n X n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right and passing through the center.

Table of values

n a(n)
0 1
1 2
2 8
3 48
4 390
5 3656
6 37834
7 417540
8 4836452
9 58130756
10 719541996
11 9121965276
12 117959864244
13 1551101290792
14 20689450250926
15 279395018584860
16 3813887739881184
17 52557835511244660
18 730403326965323706

List of values

[1, 2, 8, 48, 390, 3656, 37834, 417540, 4836452, 58130756, 719541996, 9121965276, 117959864244, 1551101290792, 20689450250926, 279395018584860, 3813887739881184, 52557835511244660, 730403326965323706]