1Math::NumSeq::DivisorCoUusnetr(3C)ontributed Perl DocumeMnattaht:i:oNnumSeq::DivisorCount(3)
2
3
4
6 Math::NumSeq::DivisorCount -- how many divisors
7
9 use Math::NumSeq::DivisorCount;
10 my $seq = Math::NumSeq::DivisorCount->new;
11 my ($i, $value) = $seq->next;
12
14 The number of divisors of i,
15
16 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, ...
17 starting i=1
18
19 i=1 is divisible only by 1 so value=1. Then i=2 is divisible by 1 and
20 2 so value=2. Or for example i=6 is divisible by 4 numbers 1,2,3,6 so
21 value=4.
22
24 See "FUNCTIONS" in Math::NumSeq for behaviour common to all sequence
25 classes.
26
27 "$seq = Math::NumSeq::DivisorCount->new ()"
28 Create and return a new sequence object.
29
30 Random Access
31 "$value = $seq->ith($i)"
32 Return the number of prime factors in $i.
33
34 This calculation requires factorizing $i and in the current code
35 after small factors a hard limit of 2**32 is enforced in the
36 interests of not going into a near-infinite loop.
37
38 "$bool = $seq->pred($value)"
39 Return true if $value occurs as a divisor count, which simply means
40 "$value >= 1".
41
43 Math::NumSeq, Math::NumSeq::PrimeFactorCount
44
45 Math::Factor::XS
46
48 <http://user42.tuxfamily.org/math-numseq/index.html>
49
51 Copyright 2011, 2012, 2013, 2014, 2016, 2017 Kevin Ryde
52
53 Math-NumSeq is free software; you can redistribute it and/or modify it
54 under the terms of the GNU General Public License as published by the
55 Free Software Foundation; either version 3, or (at your option) any
56 later version.
57
58 Math-NumSeq is distributed in the hope that it will be useful, but
59 WITHOUT ANY WARRANTY; without even the implied warranty of
60 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
61 General Public License for more details.
62
63 You should have received a copy of the GNU General Public License along
64 with Math-NumSeq. If not, see <http://www.gnu.org/licenses/>.
65
66
67
68perl v5.30.0 2019-08-05 Math::NumSeq::DivisorCount(3)