The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Mar 31 2012 12:36:55
%S 4,16,16,48,88,48,116,12,12,116,220,776,680,776,220,288,760,18440,
%T 18440,760,288,232,16104,62512,753168,62512,16104,232,96,120260,
%U 1282126,50071584,50071584,1282126,120260,96,1520,287100,178938580
%N T(n,k)=Number of nXk 0..3 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Table starts
%C ...4.....16......48......116......220.....288.......232.....96.1520
%C ..16.....88......12......776......760...16104....120260.287100
%C ..48.....12.....680....18440....62512.1282126.178938580
%C .116....776...18440...753168.50071584
%C .220....760...62512.50071584
%C .288..16104.1282126
%C .232.120260
%C ..96
%e Some solutions for n=3 k=3
%e ..3..2..3....0..1..0....3..0..0....3..2..3....3..3..3....0..3..3....0..3..2
%e ..0..0..3....3..2..0....3..0..2....1..1..3....2..1..1....2..3..1....0..3..2
%e ..0..1..1....3..2..2....3..1..3....1..0..0....0..0..0....0..0..0....1..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Dec 30 2011