Jump to content

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:29, 16 July 2020

55 bytes removed ,  3 years ago
m
→‎{{header|Haskell}}
Line 306:
sequence_A069654 = go 1 nDivCount
where
nDivCount = (,) <*> divisorCountlength . nub . divisors <$> [1..]
divisors n = [1..ceiling (sqrt $ realToFrac n)] >>= \x ->▼
divisorCount = length . nub . divisors
guard (n `mod` x == 0) >> [x, n `div` x]▼
where
▲ divisors n = [1..ceiling (sqrt $ realToFrac n)] >>= \x ->
▲ guard (n `mod` x == 0) >> [x, n `div` x]
go t ((n,d):xs)
| d == t = (t,n):go (succ t) xs
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/289470"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information