|
%I #4 Dec 03 2014 16:51:25
%S 226,3250,3250,46684,170038,46684,670690,8888108,8888108,670690,
%T 9635410,464687066,1690296520,464687066,9635410,138426508,24294592462,
%U 321542579960,321542579960,24294592462,138426508,1988695378
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9
%C Table starts
%C .....226........3250..........46684.............670690...............9635410
%C ....3250......170038........8888108..........464687066...........24294592462
%C ...46684.....8888108.....1690296520.......321542579960........61166220193608
%C ..670690...464687066...321542579960....222571918258598....154063583681248806
%C .9635410.24294592462.61166220193608.154063583681248806.388048697552904231042
%H R. H. Hardin, <a href="/A251507/b251507.txt">Table of n, a(n) for n = 1..112</a>
%F Empirical for column k:
%F k=1: a(n) = 13*a(n-1) +21*a(n-2) -18*a(n-3) -24*a(n-4)
%F k=2: [order 10]
%F k=3: [order 32]
%e Some solutions for n=2 k=4
%e ..0..0..0..2..1....0..0..2..0..0....0..0..2..0..3....0..0..2..0..0
%e ..2..2..3..3..0....2..2..0..3..1....2..2..0..3..1....2..2..0..3..2
%e ..0..0..0..0..3....0..0..3..2..0....0..2..3..1..3....0..2..2..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 03 2014
| 