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.

A063074 Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n 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.

Table of values

n a(n)
0 1
1 2
2 8
3 58
4 526
5 5448
6 61108
7 723354
8 8908546
9 113093022
10 1470597342
11 19499227828
12 262754984020
13 3589093760726
14 49596793134484
15 692260288169282
16 9747120868919060
17 138298900243896166
18 1975688102624819336
19 28396056820503468894
20 410363630540693436398

List of values

[1, 2, 8, 58, 526, 5448, 61108, 723354, 8908546, 113093022, 1470597342, 19499227828, 262754984020, 3589093760726, 49596793134484, 692260288169282, 9747120868919060, 138298900243896166, 1975688102624819336, 28396056820503468894, 410363630540693436398]