A223465 6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX6 0..20 arrays where 0..20 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 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

6264, 1113460, 231085748, 49754342824, 10911947024556, 2412122721426324, 535914084677165912, 119399063428819078304, 26653760247346854139700, 5957213342251298282740660, 1332619496372970688404684956

Offset

1,1

Comments

Column 6 of A223467

Links

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

Example

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

Crossrefs

Sequence in context: A031757 A195524 A045187 * A035904 A234440 A254635

Adjacent sequences: A223462 A223463 A223464 * A223466 A223467 A223468

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved