A068417 Number of partitionings of n X n checkerboard into three edgewise-connected sets.

0, 4, 258, 10830, 709351, 99699033, 34719687359, 32128580602967, 82102610820820733, 593301237469990370097

Offset: 1

Author

R. H. Hardin, Mar 02 2002

Keywords

• nonn

Links

• J. Kawahara, T. Horiyama, K. Hotta and S. Minato, Generating All Patterns of Graph Partitions within a Disparity Bound, WALCOM 2017. LNCS, vol. 10167, pp. 119-131, Springer, Heidelberg (2017).

Extensions

a(6)-a(10) from Jun Kawahara, Apr 03 2017