Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Nov 24 2014 10:30:47
%S 19683,300763,300763,4251528,9777655,4251528,59776471,289735900,
%T 289735900,59776471,729000000,8566581775,17751271450,8566581775,
%U 729000000,8316073576,211068335312,1088029714752,1088029714752
%N T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing medians of every three consecutive values in every row and column
%C Table starts
%C .......19683........300763........4251528........59776471......729000000
%C ......300763.......9777655......289735900......8566581775...211068335312
%C .....4251528.....289735900....17751271450...1088029714752.53509194753023
%C ....59776471....8566581775..1088029714752.138575157528960
%C ...729000000..211068335312.53509194753023
%C ..8316073576.4788105206370
%C .92959677000
%H R. H. Hardin, <a href="/A250507/b250507.txt">Table of n, a(n) for n = 1..31</a>
%e Some solutions for n=1 k=4
%e ..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0
%e ..1..0..2..1..0..2....1..1..1..1..0..1....0..2..0..0..0..1....0..2..1..0..1..2
%e ..0..2..0..2..2..0....0..1..2..1..1..0....0..1..1..1..0..1....1..2..1..1..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Nov 24 2014