Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e. ascents of length at least 2). Rows are of length 1,1,2,2,3,3,....
1, 1, 1, 1, 1, 4, 1, 11, 2, 1, 26, 15, 1, 57, 69, 5, 1, 120, 252, 56, 1, 247, 804, 364, 14, 1
1 seqfan posts
Thu Oct 8 22:53:03 CEST 2009 [seqfan] Dyck paths in A166073 and A091156