A068417 - OEIS

%I #14 Apr 05 2017 11:32:11

%S 0,4,258,10830,709351,99699033,34719687359,32128580602967,

%T 82102610820820733,593301237469990370097

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

%H J. Kawahara, T. Horiyama, K. Hotta and S. Minato, <a href="https://dx.doi.org/10.1007/978-3-319-53925-6_10">Generating All Patterns of Graph Partitions within a Disparity Bound</a>, WALCOM 2017. LNCS, vol. 10167, pp. 119-131, Springer, Heidelberg (2017).

%K nonn

%O 1,2

%A _R. H. Hardin_, Mar 02 2002

%E a(6)-a(10) from _Jun Kawahara_, Apr 03 2017