A223210 3X3X3 triangular graph coloring a rectangular array: number of n X n 0..5 arrays where 0..5 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

6, 126, 15498, 9640008, 32213930742, 568826898735456, 53598993642186546600, 26904643609262481062550540, 72104047201942444207678110553554, 1031832360324996701256333234422715357000

Offset

1,1

Comments

Diagonal of A223218

Links

Table of n, a(n) for n=1..10.

Example

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

Crossrefs

Sequence in context: A255900 A133792 A081623 * A324093 A177756 A089314

Adjacent sequences: A223207 A223208 A223209 * A223211 A223212 A223213

Keyword

nonn

Author

R. H. Hardin Mar 18 2013

Status

approved