|
%I #4 Dec 01 2014 21:13:30
%S 79,695,695,6113,17969,6113,53769,464393,464393,53769,472943,12002283,
%T 35257505,12002283,472943,4159927,310199103,2676962017,2676962017,
%U 310199103,4159927,36590017,8017100977,203249994369,597108952883
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7
%C Table starts
%C ......79........695...........6113.............53769...............472943
%C .....695......17969.........464393..........12002283............310199103
%C ....6113.....464393.......35257505........2676962017.........203249994369
%C ...53769...12002283.....2676962017......597108952883......133187012365193
%C ..472943..310199103...203249994369...133187012365193....87274898497023663
%C .4159927.8017100977.15431888950873.29707797738391051.57189617044768555919
%H R. H. Hardin, <a href="/A251373/b251373.txt">Table of n, a(n) for n = 1..312</a>
%F Empirical for column k:
%F k=1: a(n) = 8*a(n-1) +7*a(n-2)
%F k=2: a(n) = 24*a(n-1) +49*a(n-2) -34*a(n-3)
%F k=3: a(n) = 66*a(n-1) +746*a(n-2) +660*a(n-3) -6281*a(n-4) +3690*a(n-5)
%F k=4: [order 10]
%F k=5: [order 20]
%e Some solutions for n=2 k=4
%e ..0..0..0..0..1....0..0..0..0..1....0..0..0..0..0....0..0..0..0..2
%e ..2..2..1..0..0....2..2..0..2..2....2..0..2..1..0....0..2..1..1..2
%e ..1..2..2..2..0....1..1..2..1..2....2..1..2..2..1....1..1..2..1..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 01 2014
| 