OFFSET
0,2
COMMENTS
See A348453 for much more information.
The board has 4*n^2 squares. The colors of the squares do not matter. The two parts are rook-connected polygons of area 2*n^2. They do not need to be the same polygon, only that they have the same area.
This is the "labeled" version of the problem. Symmetries of the square are not taken into account. Rotations and reflections count as different.
a(4) was found on May 04 2022 by George Spahn and Manuel Kauers using an 1838 X 1838 transfer matrix found by George Spahn (see the Zeilberger link). Manuel Kauers computed the [1,2] entry of the 9th power of that matrix. The desired number a(4) is half of the coefficient of z^32 in that entry. - Doron Zeilberger, May 04 2022
Also known as the "Gerrymander Sequence" per Kauers, et al. - Michael De Vlieger, Dec 06 2022
LINKS
Anthony J. Guttmann and Iwan Jensen, The gerrymander sequence, or A348456, arXiv:2211.14482 [math.CO], 2022.
Manuel Kauers, Christoph Koutschan, and George Spahn, A348456(4) = 7157114189, arXiv:2209.01787 [math.CO], 2022.
Manuel Kauers, Christoph Koutschan, and George Spahn, How Does the Gerrymander Sequence Continue?, J. Int. Seq., Vol. 25 (2022), Article 22.9.7.
N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences: An illustrated guide with many unsolved problems, Guest Lecture given in Doron Zeilberger's Experimental Mathematics Math640 Class, Rutgers University, Spring Semester, Apr 28 2022: Slides; Slides (an alternative source).
Doron Zeilberger, Challenge to Manuel Kauers and his computer.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 27 2021
EXTENSIONS
Added a(5)-a(7) (from the Kauers et al. reference), Joerg Arndt, Sep 07 2022
a(8)-a(11) from Guttmann and Jensen (2022).
a(0)=1 prepended by Alois P. Heinz, Dec 06 2022
STATUS
approved