|
%I #5 Mar 31 2012 12:36:57
%S 2,4,4,4,4,4,2,6,6,2,8,6,8,6,8,12,26,52,52,26,12,6,90,236,154,236,90,
%T 6,32,222,492,3824,3824,492,222,32,56,674,7636,34648,58816,34648,7636,
%U 674,56,32,2158,41300,103690,951900,951900,103690,41300,2158,32,160,6546
%N T(n,k)=Number of nXk 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
%C Table starts
%C ..2...4.....4.......2.........8..........12.............6..............32
%C ..4...4.....6.......6........26..........90...........222.............674
%C ..4...6.....8......52.......236.........492..........7636...........41300
%C ..2...6....52.....154......3824.......34648........103690.........3172388
%C ..8..26...236....3824.....58816......951900......16080792.......278135578
%C .12..90...492...34648....951900.....8752012.....835055180.....26168432516
%C ..6.222..7636..103690..16080792...835055180...14513555724...2569455032894
%C .32.674.41300.3172388.278135578.26168432516.2569455032894.259726000943352
%H R. H. Hardin, <a href="/A203638/b203638.txt">Table of n, a(n) for n = 1..179</a>
%e Some solutions for n=5 k=3
%e ..0..0..0....0..0..0....0..0..1....0..0..1....1..0..0....0..0..1....1..1..1
%e ..0..0..0....1..0..0....0..0..0....0..0..1....1..1..0....1..0..0....0..0..1
%e ..1..0..1....0..1..1....0..1..1....0..0..1....1..0..0....0..0..0....0..1..1
%e ..1..1..1....0..1..1....0..1..1....1..1..1....1..0..0....1..1..1....0..0..1
%e ..0..1..1....0..1..1....1..1..1....1..0..1....1..1..1....1..1..1....0..0..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Jan 04 2012
|
