The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Jan 11 2015 11:37:39
%S 512,2992,2992,16544,23096,16544,82064,164120,164120,82064,423232,
%T 1135439,1622944,1135439,423232,2154496,8385264,17235224,17235224,
%U 8385264,2154496,11244672,60838168,180950650,259418152,180950650
%N T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median minus antidiagonal median nondecreasing horizontally and vertically
%C Table starts
%C ......512......2992.......16544........82064.........423232..........2154496
%C .....2992.....23096......164120......1135439........8385264.........60838168
%C ....16544....164120.....1622944.....17235224......180950650.......1922908527
%C ....82064...1135439....17235224....259418152.....3910850069......59192461388
%C ...423232...8385264...180950650...3910850069....84039781656....1846710080356
%C ..2154496..60838168..1922908527..59192461388..1846710080356...58500640474944
%C .11244672.447022128.20282915690.905139371305.40521984254512.1850596722079477
%H R. H. Hardin, <a href="/A253764/b253764.txt">Table of n, a(n) for n = 1..262</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 8] for n>15
%e Some solutions for n=2 k=4
%e ..0..0..0..0..0..1....0..0..0..0..0..1....0..0..0..0..0..1....0..0..0..0..0..0
%e ..1..1..0..1..0..1....1..1..1..0..1..1....1..0..0..0..0..1....1..1..0..0..1..0
%e ..1..0..1..0..1..1....1..1..0..0..0..1....0..0..1..0..0..1....0..1..0..1..0..1
%e ..1..1..0..0..1..0....0..1..1..0..1..1....1..0..0..0..1..1....1..0..1..0..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 11 2015