|
%I #4 Dec 17 2013 16:14:57
%S 160,640,640,2440,3944,2440,9612,22632,22632,9612,36976,138132,194208,
%T 138132,36976,145004,807964,1813476,1813476,807964,145004,559736,
%U 4908404,15981048,26954304,15981048,4908404,559736,2189924,28936484,148503096
%N T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal
%C Table starts
%C .....160.......640........2440..........9612..........36976...........145004
%C .....640......3944.......22632........138132.........807964..........4908404
%C ....2440.....22632......194208.......1813476.......15981048........148503096
%C ....9612....138132.....1813476......26954304......369978404.......5494251884
%C ...36976....807964....15981048.....369978404.....7752002928.....179779430264
%C ..145004...4908404...148503096....5494251884...179779430264....6709328689904
%C ..559736..28936484..1317291048...76393662524..3816435022128..224247343748408
%C .2189924.175407492.12194674440.1131348498772.88174304365260.8354188752786996
%H R. H. Hardin, <a href="/A233917/b233917.txt">Table of n, a(n) for n = 1..144</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 11]
%F k=2: [order 38]
%F k=3: [order 74]
%e Some solutions for n=3 k=4
%e ..0..2..0..3..4....6..2..6..5..6....6..4..6..4..6....6..2..6..5..6
%e ..4..5..4..5..1....4..1..4..1..4....2..5..2..5..2....4..1..3..1..4
%e ..7..3..0..2..0....3..5..6..2..6....0..1..3..1..0....6..2..6..2..0
%e ..5..2..4..5..4....4..1..3..1..3....2..5..2..5..3....4..1..4..1..4
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 17 2013
| 