User:WillNess
Jump to navigation
Jump to search
I am a newbie, interested in Haskell.
I like this:
primes = 2 : 3 : ([5,7..] `minus`
foldi (\x:xs -> (x:) . union xs)
[[p*p,p*p+2*p..] | p <- tail primes])
foldi
is on Tree-like folds. More at Prime numbers.