cp's OEIS Frontend

A201958 T(n,k)=Number of zero-sum nXk -3..3 arrays with every element unequal to at most two horizontal and vertical neighbors.

%I A201958 #7 Jul 22 2025 16:24:53
%S A201958 1,7,7,37,231,37,231,1587,1587,231,1451,17903,17091,17903,1451,9331,
%T A201958 194633,303955,303955,194633,9331,60691,2232183,4735345,9654533,
%U A201958 4735345,2232183,60691,398567,25952953,85454789,300895245,300895245,85454789
%N A201958 T(n,k)=Number of zero-sum nXk -3..3 arrays with every element unequal to at most two horizontal and vertical neighbors.
%C A201958 Table starts
%C A201958 ......1........7.......37.......231......1451........9331......60691....398567
%C A201958 ......7......231.....1587.....17903....194633.....2232183...25952953.305979795
%C A201958 .....37.....1587....17091....303955...4735345....85454789.1489376611
%C A201958 ....231....17903...303955...9654533.300895245.10356370455
%C A201958 ...1451...194633..4735345.300895245
%C A201958 ...9331..2232183.85454789
%C A201958 ..60691.25952953
%C A201958 .398567
%H A201958 R. H. Hardin, <a href="/A201958/b201958.txt">Table of n, a(n) for n = 1..40</a>
%e A201958 Some solutions for n=3 k=3
%e A201958 ..0.-3..1....1.-3..3....1..1..0....0..1..1...-2..1..3....2..3..3...-3..1..0
%e A201958 .-3.-3..3...-3.-3.-3...-1.-1.-1....0..1..1...-2..1..3....0..0..0...-3..1..1
%e A201958 ..1..1..3....3..3..2....2.-1..0...-3..1.-2...-3..1.-2...-2.-3.-3....0..0..3
%Y A201958 Column 1 is A025012
%K A201958 nonn,tabl
%O A201958 1,2
%A A201958 _R. H. Hardin_ Dec 06 2011