Ladder networks have been studied extensively using Fibonacci numbers, Chebyshev polynomials, Morgan-Voyce polynomials, Jacobsthal polynomials, etc. ([10], [11], [2], [14], [9]. [5], [3], and [4]). All these polynomials are, in fact, particular cases of the generalized polynomials defined by U„(x,y) = xU„_l(x,y)+yU„_2(x,y), (»>2) (la) with U0(x,y) = 0, Ul(x,y) = l, (lb) and V„(x, y) = xV^ix, y)...