Sequence: nth number with exactly n divisors: Difference between revisions
Content added Content deleted
| Line 423: | Line 423: | ||
n <- [1..30] :: [Integer] |
n <- [1..30] :: [Integer] |
||
if isPrime n then |
if isPrime n then |
||
pure (n, |
pure (n, nthPrime (fromIntegral n) ^ (n - 1)) |
||
else |
else |
||
pure (n, f n) |
pure (n, f n) |
||
where |
where |
||
f n = fst (havingNthDivisors n !! pred (fromIntegral n)) |
f n = fst (havingNthDivisors n !! pred (fromIntegral n)) |
||
nthPrime n = toEnum n :: Prime Integer |
nthPrime n = unPrime (toEnum n :: Prime Integer) |
||
main :: IO () |
main :: IO () |
||