Koyck's method for distributed lags works on the assumption that successive lag coefficients decrease geometrically. The present paper generalizes his approach to a family of J-shaped or unimodal lag distributions given by the Pascal distributions (of which the geometric is a special case). There is an unsystematic discussion of the problem of estimation; and the final section considers the circumstances under which a moving average can be transformed into a finite recursion.