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.

A348456 Number of ways to dissect a 2*n X 2*n chessboard into two polyominoes each of area 2*n^2.

Table of values

n a(n)
0 1
1 2
2 70
3 80518
4 7157114189
5 49852157614583644
6 28289358593043414725944353
7 1335056579423080371186456888543732162
8 5288157175943649955880910966508435029578848399795
9 1768514227824943648668138153226998430209626836775021539911012000
10 50126261987194138333095266040242179892262270498222242227767710277119489194126252
11 120727080026653995683405108506109122788592972611035310673809853406496349171003311517916839962975062

List of values

[1, 2, 70, 80518, 7157114189, 49852157614583644, 28289358593043414725944353, 1335056579423080371186456888543732162, 5288157175943649955880910966508435029578848399795, 1768514227824943648668138153226998430209626836775021539911012000, 50126261987194138333095266040242179892262270498222242227767710277119489194126252, 120727080026653995683405108506109122788592972611035310673809853406496349171003311517916839962975062]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.