A223345 3X3X3 triangular graph without horizontal edges 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,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

6, 52, 2280, 405988, 329268616, 1079538816324, 16086247351158920, 968803030037550870052, 265167552942550197086665096, 293336730456466043837816011720516

Offset

1,1

Comments

Diagonal of A223352

Links

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

Example

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

Crossrefs

Sequence in context: A164894 A027835 A055973 * A362907 A369506 A066357

Adjacent sequences: A223342 A223343 A223344 * A223346 A223347 A223348

Keyword

nonn

Author

R. H. Hardin Mar 19 2013

Status

approved