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 15:24, 16 July 2020
, 3 years ago→{{header|Haskell}}
Line 302:
sequence_A069654 :: [(Int,Int)]
sequence_A069654 = go 1 $ (,) <*>
where
where
f d r | n `mod` d == 0 = let y = n `div` d in if d == y then r+1 else r+2
| |||