A223367 6X6X6 triangular graph coloring a rectangular array: number of nX5 0..20 arrays where 0..20 label nodes of the fully triangulated graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

9552, 1686042, 356391222, 78876317946, 17823802572918, 4058501783492178, 928457167048336590, 212807842861152381090, 48847537657537109132742, 11218691918610300123247002, 2577890303656450712737152198

Offset

1,1

Comments

Column 5 of A223370

Links

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

Example

Some solutions for n=3
..1..0..1..3..6....1..0..2..4..5....1..0..2..4..8....1..0..1..0..2
..0..1..3..1..3....0..2..4..2..4....0..1..4..8..7....0..1..0..1..0
..1..3..6..3..4....2..4..2..4..1....2..4..8.13..8....1..4..2..0..2
Vertex neighbors:
0 -> 1 2
1 -> 0 2 3 4
2 -> 0 1 4 5
3 -> 1 4 6 7
4 -> 1 2 3 5 7 8
5 -> 2 4 8 9
6 -> 3 7 10 11
7 -> 3 4 6 8 11 12
8 -> 4 5 7 9 12 13
9 -> 5 8 13 14
10 -> 6 11 15 16
11 -> 6 7 10 12 16 17
12 -> 7 8 11 13 17 18
13 -> 8 9 12 14 18 19
14 -> 9 13 19 20
15 -> 10 16
16 -> 10 11 15 17
17 -> 11 12 16 18
18 -> 12 13 17 19
19 -> 13 14 18 20
20 -> 14 19

Crossrefs

Sequence in context: A162029 A251909 A251906 * A136476 A136479 A254015

Adjacent sequences: A223364 A223365 A223366 * A223368 A223369 A223370

Keyword

nonn

Author

R. H. Hardin Mar 19 2013

Status

approved