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 #14 Aug 23 2022 09:49:27
%S 1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,
%T 0,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,0,0,0,1,1,0,1,1,1,
%U 1,1,1,0,0,1,1,1,1,1,1,1,0,1,1,0,0,0,1,1,0,1,1,1,0,1,1,0,1,0,0,1,0,1,1,0,1
%N T(i,j) = 1 if F(i) AND F(j) = 0, otherwise 0, where F is A003714 and AND is the bitwise logical-and operation. Table read by antidiagonals.
%C Encodes which row/column patterns may be adjacent in 01-matrices where no two 0 elements may be adjacent. Contains many interesting recursive patterns such as Fibonacci-sized blocks of 0's along main diagonal.
%e T(3,4) = 0 because F(3) AND F(4) = 4 AND 5 = 1, which is nonzero.
%Y Cf. A003714 (Fibbinary), A005614 (row or column 1).
%Y Cf. A000045, A047999.
%Y Cf. A001333, A051736, A051737, A089934, A089935, A089936, A089937, A089938.
%K base,easy,nonn,tabl
%O 0,1
%A _Marc LeBrun_, Nov 15 2003
%E Name clarified by _Jon E. Schoenfield_, Aug 19 2022