On the number of generators for transeunt triangles

A transeunt triangle of size n consists of (n+1)×(n+1)×(n+1) 0ʹs and 1ʹs whose values are determined by the sum modulo 2 of two other local values. For a given n, two transeunt triangles of size n can be combined using the element-by-element modulo 2 sum to generate a third transeunt triangle. We show that, for large n, the 132n+1 transeunt triangles of size n can be generated from a set of only n3 generator transeunt triangles.