|
|
A223244
|
|
3-loop graph coloring a rectangular array: number of nX5 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
|
|
1
|
|
|
528, 26034, 2663082, 198634758, 22029652542, 1657797796530, 184125991023066, 13859263865786022, 1539229991488330446, 115867585607831455650, 12867476965518013727850, 968688138419572520572470
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 9*a(n-1) +8457*a(n-2) -75674*a(n-3) -827914*a(n-4) +4950877*a(n-5) +19716867*a(n-6) -72423910*a(n-7) -171181013*a(n-8) +357711566*a(n-9) +599583056*a(n-10) -618648196*a(n-11) -759861052*a(n-12) +283902208*a(n-13) +238368720*a(n-14) -20743200*a(n-15) -9720000*a(n-16)
|
|
EXAMPLE
|
Some solutions for n=3
..5..0..1..0..6....5..0..5..0..2....3..0..4..0..3....1..0..3..0..3
..0..1..0..4..0....0..1..0..3..0....0..5..0..4..0....0..3..0..4..0
..3..0..1..0..5....3..0..4..0..1....3..0..5..0..4....3..0..3..0..4
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|