Counting triangles with interlacing rows
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
For a triangle filled with distinct integers, require each entry above the bottom row to lie strictly between its two children. We give an exact formula for the number of fillings of any size, using row transfer matrices and inclusion–exclusion. A refinement prescribes the bottom-row positions of both extrema.
Provenance statement
References
- C. Kimberling, Unsolved problems and rewards (https://faculty.evansville.edu/ck6/integer/unsolved.html), Problem 18, Triangles with interlacing rows. The listed $50 reward is a donation to the OEIS Foundation in the solver's name.link
- The OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences (https://oeis.org/A347608), entry A347608, Number of interlacing triangles of size .link
- J. B. Sidoli, https://oeis.org/A347608/a347608_2.pdf On the number of interlacing triangles of size , October 29, 2021.link
Version history
- v1 · 2 pagesSubmitted by William HoweInitial depositCurrentNov 20, 2026