A337263 Array read by antidiagonals: v(m,n) (m>=0, n>=0) = 1 if there is an edge upward from grid point (m,n) in the Even Conant lattice.

1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1

Offset

0

Links

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

N. J. A. Sloane, Notes on the Conant Gasket, the Conant Lattice, and Associated Sequences, Preliminary version, Aug 23 2020

N. J. A. Sloane, The Even Conant Lattice (The grid points (m,n) are labeled with pairs v(m,n), h(m,n).)

Example

The array begins as follows. The rows are shown in the appropriate order for looking at the first quadrant (that is, row 0 is at the bottom, then row 1, and so on):
row 7 = 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, ...
row 6 = 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, ...
row 5 = 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, ...
row 4 = 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, ...
row 3 = 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, ...
row 2 = 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, ...
row 1 = 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
row 0 = 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
The initial antidiagonals (starting in the bottom left corner) are:
[1]
[1, 1]
[1, 1, 1]
[1, 0, 1, 1]
[1, 0, 1, 1, 1]
[1, 1, 1, 1, 1, 1]
[1, 1, 0, 1, 1, 1, 1]
[1, 0, 0, 0, 1, 0, 1, 1]
[1, 0, 0, 0, 1, 0, 1, 1, 1]
[1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
[1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1]
[1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1]
...

Maple

For Maple code see my "Notes".

Crossrefs

Cf. A328078, A328080, A337264, A337265, A337266.

Sequence in context: A330887 A181652 A071024 * A071037 A118172 A071039

Adjacent sequences: A337260 A337261 A337262 * A337264 A337265 A337266

Keyword

nonn,tabl

Author

N. J. A. Sloane, Aug 22 2020

Status

approved