%I #5 Mar 31 2012 12:36:46
%S 1,169,231,4327,33699,511257,4460689,48525711,529141383,6524977447,
%T 74784050095,908188232827,10930623434631,133367299797625,
%U 1609848080492237,19647665104267177,240376888100965909
%N Number of -6..6 circular arrays x(0..n+1) of n+2 elements with zero sums of x(i) and x(i)*x((i+1) mod (n+2))
%C Column 6 of A202006
%H R. H. Hardin, <a href="/A202004/b202004.txt">Table of n, a(n) for n = 1..32</a>
%e Some solutions for n=4
%e ..1....3....3....2....4....1...-2...-5...-1....1...-1....4...-5....0....1...-6
%e .-2...-6....2....4...-3....0....5....0....5....2...-6....1...-4...-2....1...-3
%e ..0...-3...-3...-3...-2....3....1...-5....6....3....5....3....1...-1...-1....5
%e .-2....0...-2...-2...-2....2....4...-1...-5...-6....6...-5...-2....2....0....0
%e ..1....6....1...-5....2....0...-5....5....0...-5...-2...-2....4....0...-1....3
%e ..2....0...-1....4....1...-6...-3....6...-5....5...-2...-1....6....1....0....1
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 07 2011