RosettaCodeData/Task/Attractive-numbers/Haskell/attractive-numbers-1.hs
2023-07-01 13:44:08 -04:00

9 lines
240 B
Haskell

import Data.Numbers.Primes
import Data.Bool (bool)
attractiveNumbers :: [Integer]
attractiveNumbers =
[1 ..] >>= (bool [] . return) <*> (isPrime . length . primeFactors)
main :: IO ()
main = print $ takeWhile (<= 120) attractiveNumbers