  In this paper, we derive several formulas of counting families of
non-intersecting paths for two-sided ladder-shaped regions. As an application,
we give a new proof to a combinatorial interpretation of Fibonacci numbers
obtained by G. Andrews in 1974.
