|
%I #6 Jun 20 2022 21:02:45
%S 448,4536,4536,47936,70486,47936,517104,1173940,1173940,517104,
%T 5630848,20235390,31382488,20235390,5630848,61624416,354809676,
%U 877700068,877700068,354809676,61624416,675750656,6280203692,25133134704
%N T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).
%C Table starts
%C 448 4536 47936 517104 5630848
%C 4536 70486 1173940 20235390 354809676
%C 47936 1173940 31382488 877700068 25133134704
%C 517104 20235390 877700068 40217750640 1898311922200
%C 5630848 354809676 25133134704 1898311922200 148522072535416
%C 61624416 6280203692 729604466884 91205700777916 11873684734291952
%C 675750656 111690695276 21336968498856 4425866604068816
%C 7420655424 1992506433044 627009808429332
%C 81506779648 35594422747852
%C 895774029696
%H R. H. Hardin, <a href="/A234175/b234175.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: a(n) = 154*a(n-2) -4144*a(n-4) +16176*a(n-6).
%F k=2: [order 35].
%e Some solutions for n=2, k=4:
%e 0 2 3 5 2 0 4 4 3 3 0 0 5 1 0 0 2 0 3 2
%e 0 3 3 4 2 0 3 2 0 1 0 1 5 0 0 0 3 2 4 4
%e 0 2 1 1 0 0 2 2 1 1 0 2 5 1 2 0 2 2 5 6
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 20 2013
| 