T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.

A206085

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.

Terms

    a(0) =124a(1) =960a(2) =960a(3) =7308a(4) =13672a(5) =7308a(6) =55864a(7) =187144a(8) =187144a(9) =55864a(10) =426596a(11) =2567488a(12) =4379116a(13) =2567488a(14) =426596a(15) =3258496a(16) =35195768a(17) =101839532a(18) =101839532a(19) =35195768a(20) =3258496a(21) =24887884a(22) =482548752a(23) =2359157212a(24) =3974151636a(25) =2359157212a(26) =482548752

External references