The OEIS is supported by the many generous donors to the OEIS Foundation.

T(n,k) = Number of zero-sum n X k -3..3 arrays with every element equal to at least one horizontal or vertical neighbor.
5

%I #7 Apr 05 2023 08:46:04

%S 0,1,1,1,13,1,7,123,123,7,5,1205,1857,1205,5,43,12287,135315,135315,

%T 12287,43,43,135179,3767643,22197147,3767643,135179,43,275,1493247,

%U 227460779,3628653641,3628653641,227460779,1493247,275,371,16814401

%N T(n,k) = Number of zero-sum n X k -3..3 arrays with every element equal to at least one horizontal or vertical neighbor.

%C Table starts

%C ...0.......1.........1..........7..........5........43.........43......275.371

%C ...1......13.......123.......1205......12287....135179....1493247.16814401

%C ...1.....123......1857.....135315....3767643.227460779.8550543057

%C ...7....1205....135315...22197147.3628653641

%C ...5...12287...3767643.3628653641

%C ..43..135179.227460779

%C ..43.1493247

%C .275

%H R. H. Hardin, <a href="/A202134/b202134.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for n=3, k=3

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

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

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

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Dec 11 2011

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

Last modified September 20 02:18 EDT 2024. Contains 376016 sequences. (Running on oeis4.)