|
Search: id:A089939
|
|
|
| A089939 |
|
Table T(i,j)=1 else 0, just when F(i) AND F(j) = 0, where F is A003714, AND is the bit-wise logical-and operation. |
|
+0
2
|
|
| 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
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Encodes which row/column patterns may be adjacent in 01-matrices where no two 0 elements may be adjacent. Many interesting recursive patterns such as Fibonacci-sized blocks of 0's along main diagonal, etc.
|
|
EXAMPLE
|
T(3,4)=0 because F(3) AND F(4) = 4 AND 5 = 1, which is nonzero.
|
|
CROSSREFS
|
Cf. A003714, A000045, A001333, A051736, A051737, A089934, A089935, A089936, A089937, A089938.
Sequence in context: A106470 A106465 A099990 this_sequence A059095 A105597 A153490
Adjacent sequences: A089936 A089937 A089938 this_sequence A089940 A089941 A089942
|
|
KEYWORD
|
base,easy,nonn,tabl
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Nov 15 2003
|
|
|
Search completed in 0.002 seconds
|
