A068416
Number of partitionings of n X n checkerboard into two edgewise-connected sets.
Original entry on oeis.org
0, 6, 53, 627, 16213, 1123743, 221984391, 127561384993, 215767063451331, 1082828220389781579, 16209089366362071416785, 726438398002211876667379681, 97741115155002465272674416929195, 39565596445488219947994403962984729307
Offset: 1
Illustration of a(2)=6:
11 12 12 12 11 11
22 12 22 11 12 21
Illustration of a few solutions of a(3):
111 112 122 111 111
121 111 112 212 111
111 111 222 222 222
- Anthony J. Guttmann and Iwan Jensen, Table of n, a(n) for n = 1..26
- Benjamin Fifield, Kosuke Imai, Jun Kawahara, and Christopher T. Kenny, The Essential Role of Empirical Validation in Legislative Redistricting Simulation, Tech. rep., Department of Government and Department of Statistics, Harvard University (2019).
- Anthony J. Guttmann and Iwan Jensen, The gerrymander sequence, or A348456, arXiv:2211.14482 [math.CO], 2022.
- Eric Weisstein's World of Mathematics, Grid Graph.
- Eric Weisstein's World of Mathematics, Minimal Edge Cut.
A068392
Number of partitions of n X n checkerboard into two edgewise-connected sets, counting partitions equal under rotation or reflection only once.
Original entry on oeis.org
0, 2, 11, 92, 2100, 140834
Offset: 1
A068393
Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets. Partitions equal under rotation or reflection are counted only once.
Original entry on oeis.org
2, 3, 7, 44, 494, 748827, 99987552, 23904291912, 23904291912, 14647978829979, 16186345621426754, 45843626565163628751, 235646717730827228414584, 3099290829556018890177304005
Offset: 2
From _Andrew Howroyd_, Apr 15 2016: (Start)
Case n=4: There are 2 nonisomorphic symmetrical solutions (see illustration below). a(4)=(A068381(4)/8 + 2)/2 = 7.
__.__.__.__. __.__.__.__.
| __ __| | __ | |
| | | | | | | | | |
|__| |__| | | | |__| |
|__.__.__.__| |__|__.__.__|
Case n=5: There are 7 nonisomorphic symmetrical solutions (see illustration below). a(5)=(A068381(5)/8 + 7)/2 = 44.
__.__.__.__.__. __.__.__.__.__. __.__.__.__.__. __.__.__.__.__.
| __| |__ | | __| |__ | | |__ __| | | | __ | |
| |__ __| | | | __ | | | __| |__ | | | | | | |
| __| |__ | | | | | | | | | __ | | | | | | | |
| |__.__.__| | | |__| |__| | | |__| |__| | | |__| |__| |
|__.__.__.__.__| |__.__.__.__.__| |__.__.__.__.__| |__.__.__.__.__|
__.__.__.__.__. __.__.__.__.__. __.__.__.__.__.
|__.__ __.__| |__ __ __| | __ __ |
| __| |__ | | | | | | | |__| | | |__|
| | __ | | | | | | | | | __| |__ |
| |__| |__| | | |__| |__| | | |__.__.__| |
|__.__.__.__.__| |__.__.__.__.__| |__.__.__.__.__|
(End)
Showing 1-3 of 3 results.
Comments