Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Content added Content deleted
(Added Wren) |
|||
Line 330: | Line 330: | ||
sequence_A069654 = go 1 $ (,) <*> countDivisors <$> [1..] |
sequence_A069654 = go 1 $ (,) <*> countDivisors <$> [1..] |
||
where |
where |
||
go t ((n,c):xs) | c == t = (t,n):go (succ t) xs |
|||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
f x r | n `mod` x == 0 = if n `div` x == x then r+1 else r+2 |
|||
⚫ | |||
⚫ | |||
f x r | n `mod` x == 0 = if n `div` x == x then r+1 else r+2 |
|||
| otherwise = r |
|||
main :: IO () |
main :: IO () |