T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =5a(5) =1a(6) =1a(7) =9a(8) =9a(9) =1a(10) =1a(11) =13a(12) =18a(13) =13a(14) =1a(15) =1a(16) =33a(17) =30a(18) =30a(19) =33a(20) =1a(21) =1a(22) =69a(23) =107a(24) =72a(25) =107a(26) =69a(27) =1a(28) =1a(29) =121