2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/104710We show bijectively that the Catalan number C_n counts Dyck (n+1)-paths in which the terminal descent is of even length and all other descents to ground level (if any) are of odd length.3 pages, LaTeXCombinatorics05A19; 05A15text