T(n, k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k. Triangle T(n,k), read by rows.
A132372
T(n, k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k. Triangle T(n,k), read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =1a(6) =6a(7) =10a(8) =5a(9) =1a(10) =22a(11) =38a(12) =22a(13) =7a(14) =1a(15) =90a(16) =158a(17) =98a(18) =38a(19) =9a(20) =1a(21) =394a(22) =698a(23) =450a(24) =194a(25) =58a(26) =11a(27) =1a(28) =1806a(29) =3218
External references
- oeis: A132372