login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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.

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, A000045, A001333, A051736, A051737, A089934, A089935, A089936, A089937, A089938.

Sequence in context: A106465 A071027 A099990 * A059095 A105597 A071026

Adjacent sequences:  A089936 A089937 A089938 * A089940 A089941 A089942

KEYWORD

base,easy,nonn,tabl

AUTHOR

Marc LeBrun, Nov 15 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 22 19:36 EST 2018. Contains 299469 sequences. (Running on oeis4.)