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 #12 Dec 05 2019 08:21:51
%S 7,15,15,31,43,31,63,115,115,63,127,304,409,304,127,255,787,1389,1389,
%T 787,255,511,2033,4658,6176,4658,2033,511,1023,5219,15327,26680,26680,
%U 15327,5219,1023,2047,13398,50177,113694,150132,113694,50177,13398,2047
%N T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2X2 subblocks lexicographically nondecreasing, and all 2 X 2 permanents nonzero.
%C Table starts
%C ....7....15.....31......63......127.......255........511........1023
%C ...15....43....115.....304......787......2033.......5219.......13398
%C ...31...115....409....1389.....4658.....15327......50177......163232
%C ...63...304...1389....6176....26680....113694.....476919.....1988919
%C ..127...787...4658...26680...150132....825967....4484324....24023995
%C ..255..2033..15327..113694...825967...5920734...41716355...290523224
%C ..511..5219..50177..476919..4484324..41716355..384523522..3504247804
%C .1023.13398.163232.1988919.24023995.290523224.3504247804.42202897239
%H R. H. Hardin, <a href="/A204740/b204740.txt">Table of n, a(n) for n = 1..220</a>
%e Some solutions for n=4 k=3
%e ..0..1..1..0....1..0..1..1....1..0..1..1....1..1..0..1....0..1..0..1
%e ..1..1..0..1....0..1..1..1....1..1..1..0....0..1..1..1....1..0..1..0
%e ..1..0..1..0....1..0..1..1....1..0..1..1....1..0..1..0....1..1..0..1
%e ..1..1..1..1....1..1..1..1....0..1..1..1....1..1..1..1....0..1..1..1
%e ..1..1..1..1....0..1..1..0....1..1..1..1....0..1..0..1....1..1..1..1
%Y Column 1 is A000225(n+2).
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 18 2012