Number of triangular matrices T(n,i,k), k <= i <= n, with entries "0" or "1" with the property that each triple {T(n,i,k), T(n,i,k+1), T(n,i-1,k)} containing a single "0" can be successively replaced by {1, 1, 1} until finally no "0" entry remains.

A295928

Number of triangular matrices T(n,i,k), k <= i <= n, with entries "0" or "1" with the property that each triple {T(n,i,k), T(n,i,k+1), T(n,i-1,k)} containing a single "0" can be successively replaced by {1, 1, 1} until finally no "0" entry remains.

Terms

    a(0) =1a(1) =3a(2) =16a(3) =122a(4) =1188a(5) =13844a(6) =185448a(7) =2781348a(8) =45868268a(9) =821096828a(10) =15804092592a(11) =324709899276

External references