cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A381555 Triangle read by rows T(n,k) is the number of diamond coverings for a specific number of diamonds covering an even length row of triangles.

Original entry on oeis.org

1, 4, 1, 8, 4, 1, 13, 16, 4, 1, 19, 41, 24, 4, 1, 26, 85, 85, 32, 4, 1, 34, 155, 231, 145, 40, 4, 1, 43, 259, 532, 489, 221, 48, 4, 1, 53, 406, 1092, 1365, 891, 313, 56, 4, 1, 64, 606, 2058, 3333, 2926, 1469, 421, 64, 4, 1, 76, 870, 3630, 7359, 8294, 5551, 2255, 545, 72, 4
Offset: 0

Views

Author

Craig Knecht, Feb 27 2025

Keywords

Comments

The total number of ways the diamond can cover a single row of length(n) triangles is the Fibonacci series. This total can be subdivided into categories based on the number of covering diamonds. The number of categories increase with the length of the row providing the structure of the triangle (see illustrations in the link below).
The above process provides a way to subdivide the individual Fibonacci numbers.
Comparing the diamond covering of a row of triangles shown here to the diamond corona of a hexagon A380346 or a diamond A380416 may be instructive.
A381552 provides additional graphics that help explain the diamond covering.

Examples

			Triangle begins:
  1, 4;
  1, 8, 4;
  1, 13, 16, 4;
  1, 19, 41, 24, 4;
  1, 26, 85, 85, 32, 4;
  1, 34, 155, 231, 145, 40, 4;
		

Crossrefs