A223413 4X4X4 triangular graph without horizontal edges 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,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

1312, 169124, 25615364, 3940419696, 612911291636, 95513129162264, 14904204066672312, 2326349099057774436, 363184176411838010916, 56702240837550840861524, 8852941775002134479343440

Offset

1,1

Comments

Column 6 of A223415

Links

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

Example

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

Crossrefs

Sequence in context: A295562 A030646 A223612 * A333407 A221155 A237393

Adjacent sequences: A223410 A223411 A223412 * A223414 A223415 A223416

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved