login

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”).

T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with no 4x4 subblock diagonal sum less than the antidiagonal sum
5

%I #4 Jun 07 2015 16:50:57

%S 41728,386304,386304,3512272,5392960,3512272,27566112,58713912,

%T 58713912,27566112,202381312,479373352,730627431,479373352,202381312,

%U 1439941888,4020536064,5979059398,5979059398,4020536064,1439941888,9687764256

%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with no 4x4 subblock diagonal sum less than the antidiagonal sum

%C Table starts

%C ......41728......386304......3512272......27566112.....202381312....1439941888

%C .....386304.....5392960.....58713912.....479373352....4020536064...28017797984

%C ....3512272....58713912....730627431....5979059398...52832293444..341477947200

%C ...27566112...479373352...5979059398...38427363716..282329901252.1449214072632

%C ..202381312..4020536064..52832293444..282329901252.1840394397973.7933658831926

%C .1439941888.28017797984.341477947200.1449214072632.7933658831926

%H R. H. Hardin, <a href="/A258689/b258689.txt">Table of n, a(n) for n = 1..59</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 45]

%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

%e ..0..0..0..1..0..0..0....0..1..0..1..0..0..0....0..1..0..1..1..1..0

%e ..0..0..0..0..0..1..0....0..0..0..1..1..0..1....1..1..0..1..0..1..1

%e ..1..0..0..1..1..0..1....0..0..0..0..1..1..1....0..0..0..1..1..1..1

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Jun 07 2015