The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Dec 18 2015 18:18:29
%S 5,52,2172,307144,200258884,465277782336,5036570504598960,
%T 194136255385117730696,34835929955107905273340132,
%U 22243413468977139564311499153224,66105120187260568220771918409079162896
%N Two-loop graph coloring a rectangular array: number of n X n 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
%C Diagonal of A223255
%H R. H. Hardin, <a href="/A223248/b223248.txt">Table of n, a(n) for n = 1..12</a>
%e Some solutions for n=3
%e ..0..1..0....1..0..1....0..3..0....4..0..2....3..0..2....3..0..3....4..0..2
%e ..3..0..2....0..2..0....2..0..3....0..1..0....0..4..0....0..4..0....0..2..1
%e ..4..3..0....3..0..1....0..3..0....1..0..4....4..0..4....3..0..3....2..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 18 2013