a(n) is the total number of down-steps after the final up-step in all 3_2-Dyck paths of length 4*n (n up-steps and 3*n down-steps).

A334609

a(n) is the total number of down-steps after the final up-step in all 3_2-Dyck paths of length 4*n (n up-steps and 3*n down-steps).

Terms

    a(0) =0a(1) =6a(2) =46a(3) =339a(4) =2553a(5) =19723a(6) =155805a(7) =1253931a(8) =10249096a(9) =84864051a(10) =710429304a(11) =6003238901a(12) =51140131770a(13) =438729741450

External references