%I #5 Dec 18 2015 18:18:30
%S 15,248,25436,14270468,44494633876,751323264058296,
%T 69480486701806161900,34690065037599351161239084,
%U 94456106387833550741267252957732,1387026638297370437542605944364720106044
%N 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..14 arrays where 0..14 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 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Diagonal of A223432
%e Some solutions for n=3
%e ..1..3..1....7..3..7....7.11..6....7..4..8...11..7..4....8..4..8...11..7.12
%e ..3..7..3....3..7.12...12..7..3....3..1..4....7..4..1....4..2..5....6..3..7
%e ..6..3..7....6.11..7....7.11..7....1..3..1....4..2..0....1..4..8....3..1..4
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 20 2013