Binomial Theorem, Pascal & Combinatorial Identities · Superchallenge problem

A lattice path from $(0,0)$ to $(8,8)$ uses $16$ unit steps, each one step right or one step up. How many such paths never touch the line $y=x+3$?