|
%I #5 Mar 31 2012 12:36:57
%S 3,9,9,18,16,18,26,46,46,26,26,16,172,16,26,12,596,1430,1430,596,12,
%T 98,936,17452,20000,17452,936,98,366,5326,225034,584450,584450,225034,
%U 5326,366,796,64452,3278068,37380604,8227090,37380604,3278068,64452,796,996
%N T(n,k)=Number of nXk 0..2 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Table starts
%C ...3.....9.......18........26.........26.........12........98.........366
%C ...9....16.......46........16........596........936......5326.......64452
%C ..18....46......172......1430......17452.....225034...3278068....44996822
%C ..26....16.....1430.....20000.....584450...37380604.126312616.51978629884
%C ..26...596....17452....584450....8227090.3806301462
%C ..12...936...225034..37380604.3806301462
%C ..98..5326..3278068.126312616
%C .366.64452.44996822
%H R. H. Hardin, <a href="/A203600/b203600.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=5 k=3
%e ..1..0..0....0..1..2....2..2..2....0..0..0....1..0..0....2..1..0....1..1..0
%e ..1..1..0....0..2..2....1..2..1....1..1..0....1..2..2....1..0..0....2..2..0
%e ..2..0..0....2..1..2....0..0..2....1..2..2....1..2..2....1..2..0....2..1..0
%e ..2..2..2....2..0..0....0..0..2....0..2..1....0..1..2....2..2..0....2..0..0
%e ..1..2..1....0..0..1....1..1..0....0..2..2....0..0..0....2..2..1....2..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Jan 03 2012
|
