Dedicated to the memory of Alexander M. Ostrowski on the occasion of the lOOth anniversary of his birth.Summary. Given an integer n/> 1, and the orthogonal polynomials n,( -; dcr) of degree n relative to some positive measure da, the polynomial system "induced" by n, is the system of orthogonal polynomials {r~k. ~ } corresponding to the modified measure d~, = n~ d~. Our interest here is in the problem of determining the coefficients in the three-term recurrence relation for the polynomials ~k,, from the recursion coefficients of the orthogonal polynomials belonging to the measure do. A stable computational algorithm is proposed, which uses a sequence of QR steps with shifts. For all four Chebyshev measures da, the desired coefficients can be obtained analytically in closed form. For Chebyshev measures of the first two kinds this was shown by AI-Salam, Allaway and Askey, who used sieved orthogonal polynomials, and by Van Assche and Magnus via polynomial transformations. Here, analogous results are obtained by elementary methods for Chebyshev measures of the third and fourth kinds. (The same methods are also applicable to the other two Chebyshev measures.) Interlacing properties involving the zeros of n, and those of ~, + ~,, are studied for Gegenbauer measures, as well as the orthogonality--or lack thereof--of the polynomial sequence {~ .... i }.