Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 15:26, 11 April 2019
, 5 years agoMove Perl 6 entry from Anti-primes plus task
Thundergnat (talk | contribs) (Draft task A005179, split off from anti-primes plus) |
Thundergnat (talk | contribs) (Move Perl 6 entry from Anti-primes plus task) |
||
Line 7:
;Task
Show here, on this page, at least the first 15 terms of the sequence.
=={{header|Perl 6}}==
{{works with|Rakudo|2019.03}}
<lang perl6>sub div-count (\x) {
return 2 if x.is-prime;
+flat (1 .. x.sqrt.floor).map: -> \d {
unless x % d { my \y = x div d; y == d ?? y !! (y, d) }
}
}
my $limit = 15;
put "First $limit terms of OEIS:A005179";
put (1..$limit).map: -> $n { first { $n == .&div-count }, 1..Inf };
</lang>
{{out}}
<pre>First 15 terms of OEIS:A005179
1 2 4 6 16 12 64 24 36 48 1024 60 4096 192 144</pre>
| |||