login
4-level binary fanout graph coloring a rectangular array: number of n X 7 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.
1

%I #6 Apr 25 2023 14:03:15

%S 1752,102528,7557696,553773760,42196917280,3173584196608,

%T 242750087582720,18355130761851904,1404211778503671808,

%U 106325547561713332224,8132796906906251831296,616068752536307030687744

%N 4-level binary fanout graph coloring a rectangular array: number of n X 7 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

%C Column 7 of A223449.

%H R. H. Hardin, <a href="/A223448/b223448.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=3

%e ..0..1..3..5..3..1..4....0..1..3..1..0..1..4....0..1..4..1..0..1..4

%e ..1..0..1..3..1..4..8....1..3..1..0..1..3..1....1..3..1..3..1..3..1

%e ..0..2..0..1..0..1..4....0..1..0..1..3..5..3....0..1..0..1..4..1..4

%Y Cf. A223449.

%K nonn

%O 1,1

%A _R. H. Hardin_, Mar 20 2013