cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A201799 #6 Jul 22 2025 16:20:47
%S A201799 85,3617,48335,988589,20960485,472565771,10857153407,253641348337,
%T A201799 5979418257253,142075597768273,3395164032578079,81529069984570623,
%U A201799 1965470518289395959
%N A201799 Number of zero-sum nX4 -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors.
%C A201799 Column 4 of A201803
%e A201799 Some solutions for n=3
%e A201799 ..0.-1..1..0...-2..1..1..0...-2.-2.-1.-1...-1..1.-2..1...-1..2.-2.-2
%e A201799 ..0.-1..1..1...-2..1..1..1....2..2..0..0....1..1.-2..1....2..2..0..0
%e A201799 ..0.-1..1.-1...-2..1..0..0...-1..2..0..1....0..0.-2..2...-2..0..0..1
%K A201799 nonn
%O A201799 1,1
%A A201799 _R. H. Hardin_ Dec 05 2011

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.