2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/156899We introduce an infinite family of lower triangular matrices $Γ^{(s)}$, where $γ_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of these matrices satisfy a three-term row recurrence and we deduce recursive and asymptotic properties for the total number $τ_s(n)$ of tableaux on $n$ cells and with at most $s$ columns.11 pages, 1 figureCombinatorics05E10. 05A15Combinatorial properties of the numbers of tableaux of bounded heighttext