A089939 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.

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, 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, 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

Offset

0,1

Comments

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.

Links

Table of n, a(n) for n=0..104.

Example

T(3,4) = 0 because F(3) AND F(4) = 4 AND 5 = 1, which is nonzero.

Crossrefs

Cf. A003714 (Fibbinary), A005614 (row or column 1).

Cf. A000045, A047999.

Cf. A001333, A051736, A051737, A089934, A089935, A089936, A089937, A089938.

Sequence in context: A071027 A337264 A099990 * A330550 A059095 A187944

Adjacent sequences: A089936 A089937 A089938 * A089940 A089941 A089942

Keyword

base,easy,nonn,tabl

Author

Marc LeBrun, Nov 15 2003

Extensions

Name clarified by Jon E. Schoenfield, Aug 19 2022

Status

approved