  Continuing pioneering work of Christophe Doche and Laurent Habsieger from
2004, we develop computer algebra algorithms, implemented in Maple, for finding
the (necessarily rational) generating function for any integral of products,
and in particular, moments, of Rudin-Shapiro polynomials. We generate a lot of
output, and confirm again a conjecture of Saffari for the asymptotics for small
(and not so small) powers. We also confirm, for small powers, a related, more
general, conjecture, of Hugh Montgomery. Finally, we outline a proof of
Saffari's full conjecture, that we believe can be turned into a full proof. [In
this version we report that Brad Rodgers has independently found a (complete!)
proof of Saffari's conjecture here http://arxiv.org/abs/1606.01637] .
