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.

9216, 2918052, 1148040516, 470062209228, 195984333263964, 82235766550254744, 34624128327772135980, 14597586270725996512680, 6158981902609383720107172, 2599381915639470430301409024, 1097252078673262192056218956776

Offset

1,1

Comments

Column 6 of A223305

Links

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

Example

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

Crossrefs

Sequence in context: A175743 A204103 A209595 * A031594 A262508 A272596

Adjacent sequences: A223300 A223301 A223302 * A223304 A223305 A223306

Keyword

nonn

Author

R. H. Hardin, Mar 19 2013

Status

approved