Anonymous user
Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Sequence: smallest number greater than previous term with exactly n divisors (view source)
Revision as of 16:31, 16 July 2020
, 3 years ago→{{header|Haskell}}
Line 304:
sequence_A069654 = go 1 $ (,) <*> countDivisors <$> [1..]
where
countDivisors n = foldr f 0 [1..floor
where
f x r | n `mod` x == 0 = if n `div` x == x then r+1 else r+2
| |||