A lattice path in the plane from
(0,0) to (m,n) with weighted horizontal, vertical, and diagonal steps will be called a
weighted lattice path. We determine the number of unrestricted weighted
lattice paths, the number of paths below a line, and the number of paths
which must remain between two parallel lines wilh unil slope. We also obtain
generating functions for the number of paths which remain below the line
y = x; these extend results obtained by Carlitz and Riordan for the ballot
numbers.