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

A334610

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

Terms

    a(0) =0a(1) =7a(2) =58a(3) =505a(4) =4650a(5) =44677a(6) =443238a(7) =4507461a(8) =46744100a(9) =492492330a(10) =5257084420a(11) =56734340091a(12) =618001356458

External references