Now, count all primitive 2D words over a binary alphabet; call this \psi_2(m,n). We get a table with some rather fast-growing values. But if we focus on the second row (i.e., the values of \psi_2(2,n)), the number of 2xn primitive 2D words is the same as the number of exact-period-n pedal triangles!