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 #6 Jun 20 2022 20:35:23
%S 408,2628,2628,16848,13952,16848,109224,74308,74308,109224,704160,
%T 409268,329984,409268,704160,4594320,2261220,1558600,1558600,2261220,
%U 4594320,29782080,12903164,7424496,6480632,7424496,12903164,29782080,195532704
%N T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).
%C Table starts
%C 408 2628 16848 109224 704160 4594320
%C 2628 13952 74308 409268 2261220 12903164
%C 16848 74308 329984 1558600 7424496 37338544
%C 109224 409268 1558600 6480632 27355272 123900992
%C 704160 2261220 7424496 27355272 102856704 421924272
%C 4594320 12903164 37338544 123900992 421924272 1588256456
%C 29782080 73793620 189345872 568426072 1760111424 6105726016
%C 195532704 434990348 1006857472 2764737872 7867555584 25353440600
%C 1274237568 2565773508 5389971408 13583184744 35635123680
%C 8416415808 15562814252 30077051488 70136986928
%H R. H. Hardin, <a href="/A234702/b234702.txt">Table of n, a(n) for n = 1..96</a>
%F Empirical for column k:
%F k=1: a(n) = 6*a(n-1) +90*a(n-2) -540*a(n-3) -2016*a(n-4) +12096*a(n-5).
%F k=2: [order 15].
%F k=3: [order 31].
%e Some solutions for n=2, k=4:
%e 0 5 1 1 7 0 3 1 0 0 2 2 4 4 7 2 2 3 1 3
%e 4 4 5 0 1 6 4 7 1 6 0 5 2 7 5 6 1 7 0 7
%e 5 0 6 6 2 2 5 3 2 2 1 1 3 3 6 6 6 7 5 7
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 29 2013