login
A223298
4X4X4 triangular graph coloring a rectangular array: number of n X n 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
0
10, 324, 76788, 118001928, 1208825525124, 82235766550254744, 37878775658906097327552, 117618648410211422628657954648, 2498412967821017756764735962549014076
OFFSET
1,1
COMMENTS
Diagonal of A223305
EXAMPLE
Some solutions for n=3
..2..5..8....1..2..4....4..1..3....7..8..4....4..7..3....8..7..6....8..4..8
..0..2..4....2..4..7....1..2..4....3..4..1....5..8..4....7..6..7....4..2..4
..2..0..1....4..1..4....0..1..2....4..2..4....9..5..2....4..3..6....5..4..1
CROSSREFS
Sequence in context: A180584 A048345 A325726 * A164055 A064343 A127823
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 19 2013
STATUS
approved