Facteurs des suites de Rudin-Shapiro généralisées

\Integrating" paperfolding sequences yields generalized Rudin-Shapiro sequences. We study the factors (subwords) of these sequences, giving an (optimal) property of \half-synchronization" and a uniform linear bound for the recurrence function. We also study the powers occurring in these sequences, and we show that the language consisting of all their factors is not contextfree.