Recurring-Sequence Tiling
Joseph Arkin, David C. Arney, Gerald E. Bergum, Stefan A. Burr, Bruce J. Porter · The Fibonacci Quarterly · 1989
In this paper we consider the problem of dividing a rectangle into nonoverlapping squares and rectangles using recurring-sequence tiling. The results obtained herein are illustrated with appropriate figures. These results, with the exception of basic introductory material, are believed to be new. There seem to be no such results in the literature. Among the many generating functions possible, we choose the following: Note that G(x) ~ k