A201803 T(n,k)=Number of zero-sum nXk -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors.
1, 5, 5, 19, 85, 19, 85, 455, 455, 85, 381, 3617, 4057, 3617, 381, 1751, 28625, 48335, 48335, 28625, 1751, 8135, 235827, 562961, 988589, 562961, 235827, 8135, 38165, 1972115, 7099021, 20960485, 20960485, 7099021, 1972115, 38165, 180325, 16703881
Offset: 1
Examples
Some solutions for n=4 k=3 .-1..1.-2....2..2.-2...-2..2..2....0..1..2....0..1..1....2..0..0....0.-1..2 .-1..1..1...-2..2.-2....2..2..2...-2..1..1...-1.-1..1....1..0..0....1.-1.-1 ..0..1..1...-2..2.-2...-2.-2.-2...-2..1..1...-1.-1.-1....1.-1.-1....1..1..1 ..0..0.-1...-1..2..1....1.-2.-1...-1.-1.-1....2..2.-2...-2.-1..1...-1.-1.-1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Crossrefs
Column 1 is A005191
Comments