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 14:11, 16 July 2020
, 3 years ago→{{header|Haskell}}
Line 312:
, n `mod` x == 0 ]
go t ((n,d):xs)
| d == t = (
| otherwise = go t xs
| |||