The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201798 Number of zero-sum nX3 -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors 1

%I

%S 19,455,4057,48335,562961,7099021,90062519,1168520339,15269686011,

%T 201396758073,2670595602167,35597100656221,476317522683397,

%U 6395415423401799,86112911010980123,1162374111689802707

%N Number of zero-sum nX3 -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors

%C Column 3 of A201803

%H R. H. Hardin, <a href="/A201798/b201798.txt">Table of n, a(n) for n = 1..40</a>

%e Some solutions for n=4

%e .-2.-2.-2....1.-1..1....1..1.-2....0..1..1...-1..0..0....1..1.-2....1.-2..2

%e ..2..2..2....0.-1..2...-2.-2..2....2..2..2....1..1..1....1..1.-2...-2.-2..2

%e .-1.-1.-1....0.-1..2....2.-2..2...-2.-2.-2....0..1..1...-1..1..1....2..2..2

%e ..2.-1..2...-2.-1..0....2.-2..0...-1.-1..0....0.-2.-2...-1.-1..1...-2.-2.-1

%K nonn

%O 1,1

%A _R. H. Hardin_ Dec 05 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 17:44 EDT 2021. Contains 345008 sequences. (Running on oeis4.)