|
A223303
|
|
4X4X4 triangular graph coloring a rectangular array: number of nX6 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
|
|
1
|
|
|
%I #4 Mar 19 2013 09:22:48
%S 9216,2918052,1148040516,470062209228,195984333263964,
%T 82235766550254744,34624128327772135980,14597586270725996512680,
%U 6158981902609383720107172,2599381915639470430301409024,1097252078673262192056218956776
%N 4X4X4 triangular graph coloring a rectangular array: number of nX6 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Column 6 of A223305
%H R. H. Hardin, <a href="/A223303/b223303.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..0..1..4..8....0..1..0..2..4..7....0..1..4..1..3..1....0..1..4..1..3..1
%e ..1..0..1..0..1..4....1..0..1..4..1..3....1..0..1..2..1..0....1..0..1..2..1..3
%e ..0..1..2..1..4..2....0..1..3..7..3..1....0..1..2..1..3..1....0..1..0..1..4..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 19 2013
|
