[Haskell-cafe] Is there an efficient way to generate Euler's totient function for [2, 3..n]?

[KC]

Is there an efficient way to generate Euler's totient function for [2,3..n]?

Or an arithmetical sequence?

Or a geometric sequence?

Or some generalized sequence?

-- 
--
Regards,
KC