A223302 4X4X4 triangular graph coloring a rectangular array: number of nX5 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.

2304, 298620, 46589268, 7442199324, 1208825525124, 195984333263964, 31982581839418764, 5198236290762699924, 848677490133585108996, 138037800797986968319404, 22532346060071398807282764

Offset: 1

Author

R. H. Hardin Mar 19 2013

Keywords

• nonn

Comments

Column 5 of A223305

Examples

			Some solutions for n=3
..0..1..2..1..4....0..1..3..7..8....0..1..4..2..4....0..1..2..4..7
..1..2..5..4..2....1..2..1..4..5....1..0..2..4..2....1..2..4..3..4
..0..1..2..1..4....2..0..2..5..9....2..1..4..1..4....0..1..3..4..3
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210