Anonymous user
Sequence: nth number with exactly n divisors: Difference between revisions
Sequence: nth number with exactly n divisors (view source)
Revision as of 18:21, 16 May 2020
, 4 years ago→{{header|Haskell}}
Line 421:
nths :: [(Integer, Integer)]
nths = do
n <- [1..
if isPrime n then
pure (n, nthPrime (fromIntegral n) ^
else
pure (n, f n)
Line 462:
(28,9152)
(29,1116713952456127112240969687448211536647543601817400964721)
(30,6768)
(31,1300503809464370725741704158412711229899345159119325157292552449)
(32,3990)
(33,12166144)
(34,9764864)
(35,446265625)</pre>
=={{header|Java}}==
| |||