Series expansions for the ideal chain problem in Sierpinski carpets we
re calculated and critical exponents gamma < 1 and nu < 1/2 were obtai
ned with good accuracy. From the scaling properties of the probability
of the chain returning to the starting site, it is shown that the ide
al chain has asymptotic behaviour different from the random walk probl
em in those lattices.