Number of triple descents (i.e., ddd's) in all paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1).
A108444
Number of triple descents (i.e., ddd's) in all paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1).
Terms
- a(0) =5a(1) =73a(2) =857a(3) =9505a(4) =103341a(5) =1114969a(6) =11996209a(7) =128989249a(8) =1387480981a(9) =14937170089a(10) =160978217225
External references
- oeis: A108444