cp's OEIS Frontend

A203101 T(n,k) = number of nXk 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.

%I A203101 #11 Sep 02 2013 10:07:09
%S A203101 1,4,4,16,84,16,50,1080,1080,50,144,12260,48552,12260,144,422,143510,
%T A203101 2029744,2029744,143510,422,1268,1705124,87531478,308642476,87531478,
%U A203101 1705124,1268,3823,20174774,3790420430,48260497186,48260497186
%N A203101 T(n,k) = number of nXk 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.
%C A203101 Table starts
%C A203101 ....1.........4............16.................50....................144
%C A203101 ....4........84..........1080..............12260.................143510
%C A203101 ...16......1080.........48552............2029744...............87531478
%C A203101 ...50.....12260.......2029744..........308642476............48260497186
%C A203101 ..144....143510......87531478........48260497186.........27467664499412
%C A203101 ..422...1705124....3790420430......7574530822364......15712898935252156
%C A203101 .1268..20174774..163621176194...1186165852092876....8968410661761080882
%C A203101 .3823.238288768.7062389921398.185750876557274124.5118067454812170831280
%H A203101 R. H. Hardin, <a href="/A203101/b203101.txt">Table of n, a(n) for n = 1..144</a>
%e A203101 Some solutions for n=5 k=3
%e A203101 ..0..2..1....1..3..0....1..0..0....0..2..0....1..3..2....3..3..1....3..3..3
%e A203101 ..0..2..1....2..3..2....3..2..1....2..2..2....2..3..2....3..2..2....0..2..0
%e A203101 ..3..0..1....1..0..3....3..3..3....3..3..1....2..1..1....1..1..2....2..3..1
%e A203101 ..3..2..2....3..0..3....3..3..0....2..1..0....0..1..1....2..0..1....2..3..1
%e A203101 ..3..0..2....3..2..0....1..1..1....2..1..1....2..2..1....3..3..3....3..3..0
%Y A203101 For some rows, columns and diagonals see A203093-A203100.
%K A203101 nonn,tabl
%O A203101 1,2
%A A203101 _R. H. Hardin_ Dec 29 2011