|
%I #17 Oct 13 2019 22:53:13
%S 1,0,2,2,1,0,2,0,3,4,3,2,0,6,0,4,0,4,0,0,0,0,0,1,10,7,5,2,1,2
%N Irregular triangle read by rows: T(n,k), n >= 0, k >= 1, = number of cells of area k/t^2 in generation n of Jim Conant's iterative dissection of a square, where t = 2^ceiling(n/2).
%C This tiling is described in A328078. At generation n, the construction requires that each edge of the square be divided into t = 2^ceiling(n/2) segments. Then 1/t^2 is the area of the smallest possible region at generation n.
%C Sum_k T(n,k) = A328078(n), Sum_k k*T(n,k) = 4^ceiling(n/2).
%H Jim Conant, <a href="/A328078/a328078_1.png">Illustration for A328078(4) = 9.</a>
%e Start of triangle (the rows are labeled by n = 0,1,2,... and the columns by k = 1,2,3,...):
%e 1,
%e 0,2,
%e 2,1,
%e 0,2,0,3,
%e 4,3,2, (See the illustration for n=4: there are 4 regions of area 1/16, 3 of area 2/16, and 2 of area 3/16.)
%e 0,6,0,4,0,4,0,0,0,0,0,1,
%e 10,7,5,2,1,2,
%e ...
%Y Cf. A328078.
%K nonn,tabf,more
%O 0,3
%A _N. J. A. Sloane_, Oct 13 2019
|
