Tiling a strip with triangles
From MaRDI portal
Summary: In this paper, we examine the tilings of a \(2\times n\) triangular strip with triangles. These tilings have connections with Fibonacci numbers, Pell numbers, and other known sequences. We derive several different recurrences, establish some properties of these numbers, and give a refined count for these tilings (i.e., by the number and type of triangles used) and establish several properties of these refined counts.
Recommendations
- Tilings of triangles
- A strip-like tiling algorithm
- Tiling polygons with lattice triangles
- Tiling the plane with equilateral triangles
- scientific article; zbMATH DE number 1741028
- scientific article; zbMATH DE number 1256699
- Tilings of polygons with similar triangles
- scientific article; zbMATH DE number 15109
- Tilings of rectangles with triangular-tetrominoes
- Tilings with noncongruent triangles
Cites work
Cited in
(7)- scientific article; zbMATH DE number 1810569 (Why is no real title available?)
- scientific article; zbMATH DE number 1919515 (Why is no real title available?)
- Tiling a \(2 \times n\) board with dominos and \(L\)-shaped trominos
- Counting Tilings by Taking Walks in a Graph
- Combinatorial proofs of some formulas for triangular tilings
- Arithmetic and combinatorics of recurrent sequences
- Tilings of a honeycomb strip and higher order Fibonacci numbers
This page was built for publication: Tiling a strip with triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405071)