|
%I #5 Mar 31 2012 12:37:05
%S 256,1328,1328,8176,13116,8176,55848,171790,171790,55848,401164,
%T 2323490,4251766,2323490,401164,2965056,33432873,124624799,124624799,
%U 33432873,2965056,22161076,473468278,3475452601,6997750028,3475452601,473468278
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors
%C Table starts
%C .......256........1328...........8176.............55848................401164
%C ......1328.......13116.........171790...........2323490..............33432873
%C ......8176......171790........4251766.........124624799............3475452601
%C .....55848.....2323490......124624799........6997750028..........443278874512
%C ....401164....33432873.....3475452601......443278874512........56016870922512
%C ...2965056...473468278...103284968982....26283777611416......7775889911404311
%C ..22161076..6825854177..2919626746607..1671381122482219...1006455738823529884
%C .166572246.97434972458.86197641979010.99772701549024254.140049946522756985512
%H R. H. Hardin, <a href="/A205097/b205097.txt">Table of n, a(n) for n = 1..220</a>
%e Some solutions for n=4 k=3
%e ..0..1..0..0....0..0..0..2....1..2..3..1....3..0..0..3....0..1..0..0
%e ..1..1..3..1....2..1..1..0....0..1..2..3....1..3..1..0....1..0..1..1
%e ..2..2..1..2....0..3..2..1....0..1..2..3....0..1..2..2....0..3..1..2
%e ..0..3..2..2....3..0..3..2....2..1..2..3....1..0..2..3....1..1..2..2
%e ..2..1..3..3....1..2..0..3....2..3..1..3....1..2..0..2....3..2..2..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Jan 22 2012
| 