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 13:56, 18 July 2020
, 3 years ago→{{header|Haskell}}
Line 329:
sequence_A069654 :: [(Int,Int)]
sequence_A069654 = go 1 $ (,) <*> countDivisors <$> [1..]
where go t ((n,c):xs) | c == t = (t,n):go (succ t) xs
countDivisors n = foldr f 0 [1..floor $ sqrt $ realToFrac
where f x r | n `mod` x == 0 = if n `div` x == x then r+1 else r+2▼
| otherwise = r▼
▲ f x r | n `mod` x == 0 = if n `div` x == x then r+1 else r+2
▲ | otherwise = r
main :: IO ()
main = mapM_ (uncurry
{{out}}
<pre>a( 1)= 1
|