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 #5 Mar 31 2012 12:36:49
%S 66,172,172,462,530,462,1278,1766,1766,1278,3448,5948,7432,5948,3448,
%T 9394,19880,31560,31560,19880,9394,25526,66924,134338,171362,134338,
%U 66924,25526,69336,224940,572940,923788,923788,572940,224940,69336
%N T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 111 in rows, columns and nw-to-se diagonals
%C Table starts
%C .....66.....172.......462.......1278.........3448..........9394..........25526
%C ....172.....530......1766.......5948........19880.........66924.........224940
%C ....462....1766......7432......31560.......134338........572940........2443538
%C ...1278....5948.....31560.....171362.......923788.......5002208.......27264078
%C ...3448...19880....134338.....923788......6324344......43812822......304200608
%C ...9394...66924....572940....5002208.....43812822.....386981422.....3423531924
%C ..25526..224940...2443538...27264078....304200608....3423531924....38841628112
%C ..69336..755816..10435120..148104786...2106754926...30374643896...440204384164
%C .188418.2541276..44531700..804922608..14642559872..269698672006..4991946563700
%C .511960.8543094.190115264.4383730776.101786323802.2394697806290.56832465909314
%H R. H. Hardin, <a href="/A202647/b202647.txt">Table of n, a(n) for n = 1..198</a>
%e Some solutions for n=3 k=3
%e ..1..0..1..0..0....0..1..1..0..0....1..0..0..1..0....0..0..1..0..1
%e ..0..1..1..0..1....0..1..0..1..1....1..0..1..0..0....1..1..0..0..1
%e ..1..1..0..1..1....1..0..0..1..0....0..1..1..0..1....0..0..1..1..0
%e ..1..0..0..1..0....0..1..1..0..0....1..1..0..1..0....1..1..0..0..1
%e ..0..1..1..0..0....0..1..0..0..1....0..0..1..1..0....1..1..0..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Dec 22 2011