A223407 4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

10, 132, 10496, 4222748, 8949958604, 95513129162264, 5291975389978126280, 1474413700790967027512272, 2128059896246198793880831622720, 15441445504387727838090586696442043920

Offset

1,1

Comments

Diagonal of A223415

Links

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

Example

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

Crossrefs

Sequence in context: A166771 A264279 A296637 * A203325 A324421 A284162

Adjacent sequences: A223404 A223405 A223406 * A223408 A223409 A223410

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved