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.

A271802 Number of cuttings of an n X n checkerboard along grid lines into two pieces with holes disallowed.

Original entry on oeis.org

0, 6, 52, 614, 16000, 1114394, 220762028, 127074234622, 215163221802400, 1080509693050320314, 16181730102294154610684, 725449589191165593072311582, 97631783799192329642727718567824, 39528641527526180063041016094650084850
Offset: 1

Views

Author

Andrew Howroyd, Apr 14 2016

Keywords

Comments

Equivalently, the number of partitionings of an n X n checkerboard into two edgewise-connected simply-connected sets. (Cf. A068416).
Each part is required to contain at least one cell and cuttings are considered different if they only differ by rotation or reflection.

Programs

Formula

a(n) = A068416(n) - A140517(n-2).