|
%I #17 Aug 23 2020 22:23:18
%S 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,
%T 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,
%U 1,0,1,0,1,1,1,0,1,1,1,0,1,0,0,0,1,1,1,0,1,1,1
%N 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.
%H N. J. A. Sloane, <a href="/A328078/a328078_2.txt">Notes on the Conant Gasket, the Conant Lattice, and Associated Sequences</a>, Preliminary version, Aug 23 2020
%H N. J. A. Sloane, <a href="/A328078/a328078_5.pdf">The Even Conant Lattice</a> (The grid points (m,n) are labeled with pairs v(m,n), h(m,n).)
%e 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):
%e row 7 = 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, ...
%e row 6 = 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, ...
%e row 5 = 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, ...
%e row 4 = 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, ...
%e row 3 = 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, ...
%e row 2 = 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, ...
%e row 1 = 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
%e row 0 = 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...
%e The initial antidiagonals (starting in the bottom left corner) are:
%e [1]
%e [1, 1]
%e [1, 1, 1]
%e [1, 0, 1, 1]
%e [1, 0, 1, 1, 1]
%e [1, 1, 1, 1, 1, 1]
%e [1, 1, 0, 1, 1, 1, 1]
%e [1, 0, 0, 0, 1, 0, 1, 1]
%e [1, 0, 0, 0, 1, 0, 1, 1, 1]
%e [1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
%e [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
%e [1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1]
%e [1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1]
%e ...
%p For Maple code see my "Notes".
%Y Cf. A328078, A328080, A337264, A337265, A337266.
%K nonn,tabl
%O 0
%A _N. J. A. Sloane_, Aug 22 2020
|
