T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases.

A234786

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases.

Terms

    a(0) =76a(1) =484a(2) =484a(3) =3084a(4) =6660a(5) =3084a(6) =19652a(7) =91916a(8) =91916a(9) =19652a(10) =125228a(11) =1269036a(12) =2761748a(13) =1269036a(14) =125228a(15) =797988a(16) =17521780a(17) =83120724a(18) =83120724a(19) =17521780a(20) =797988a(21) =5085004a(22) =241927524a(23) =2502596188a(24) =5465582060a(25) =2502596188a(26) =241927524

External references