Number of ascents of length 1 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). An ascent is a maximal sequence of consecutive (1,1)-steps.
A191386
Number of ascents of length 1 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). An ascent is a maximal sequence of consecutive (1,1)-steps.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =2a(4) =5a(5) =10a(6) =23a(7) =46a(8) =102a(9) =204a(10) =443a(11) =886a(12) =1898a(13) =3796a(14) =8054a(15) =16108a(16) =33932a(17) =67864a(18) =142163a(19) =284326a(20) =592962a(21) =1185924a(22) =2464226a(23) =4928452a(24) =10209620a(25) =20419240a(26) =42190558a(27) =84381116a(28) =173962532a(29) =347925064
External references
- oeis: A191386