Abstract
This paper discusses the combinatorial interpretation of the H_n numbers, where each Hn denotes the number of ways to tile a 2 2 n block with 2 2 1 plates and 6-block L shapes. It then investigates a closely related tiling sequence, which is tiling a 22n bracelet with the same two building blocks, and discusses its relation with Hn. The recursive equation for both integer sequences are found using one to one correspondence, induction and Newtons Sum. Additionally, in the case of H_n numbers, its related Lucas Style sequence P_n is found. The relationship between the P_n numbers, the Bn numbers and the Hn numbers is similar to that of the Lucas numbers and the Fibonacci numbers. Finally, identities concerning H_ns generating function and its relations with other existing {2,1,2} sequences are discussed, and a theorem that generalizes the generating function of all tiling sequences is proposed and proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.