Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A337264
Array read by antidiagonals: h(m,n) (m>=0, n>=0) = 1 if there is an edge to the right from grid point (m,n) in the Even Conant lattice.
5
1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1
OFFSET
0
LINKS
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, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, ...
row 6 = 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, ...
row 5 = 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, ...
row 4 = 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, ...
row 3 = 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, ...
row 2 = 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, ...
row 1 = 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...
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, 0, 1]
[1, 1, 1, 1]
[1, 1, 0, 0, 1]
[1, 1, 0, 0, 1, 1]
[1, 0, 1, 1, 1, 0, 1]
[1, 1, 0, 1, 0, 1, 1, 1]
[1, 1, 1, 0, 0, 0, 0, 0, 1]
[1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
[1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1]
[1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1]
...
MAPLE
For Maple code see my "Notes".
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Aug 22 2020
STATUS
approved