A223466 6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX7 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

20440, 8242836, 3988872656, 2005957755820, 1033873786631384, 535914084677165912, 280173531066504459408, 146513280918538244108284, 76974708621644842747938076, 40393752736331073131254005316

Offset

1,1

Comments

Column 7 of A223467

Links

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

Example

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

Crossrefs

Sequence in context: A256104 A269279 A234552 * A281658 A234304 A242619

Adjacent sequences: A223463 A223464 A223465 * A223467 A223468 A223469

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved