NAME
Math::NumSeq::DivisorCount  how many divisors
SYNOPSIS
use Math::NumSeq::DivisorCount;
my $seq = Math::NumSeq::DivisorCount>new;
my ($i, $value) = $seq>next;
DESCRIPTION
The number of divisors of i, being 1,2,2,3,2,4,2, etc.
The sequence starts from i=1 and 1 is divisible only by itself. Then i=2 is divisible by 1 and 2. Or for example i=6 is divisible by 4 numbers 1,2,3,6.
FUNCTIONS
See "FUNCTIONS" in Math::NumSeq for behaviour common to all sequence classes.
Random Access
$value = $seq>ith($i)

Return the number of prime factors in
$i
.This calculation requires factorizing
$i
and in the current code a hard limit of 2**32 is placed on$i
, in the interests of not going into a nearinfinite loop. $bool = $seq>pred($value)

Return true if
$value
occurs as a divisor count, which simply means$value >= 1
.
SEE ALSO
Math::NumSeq, Math::NumSeq::PrimeFactorCount
HOME PAGE
http://user42.tuxfamily.org/mathnumseq/index.html
LICENSE
Copyright 2011, 2012 Kevin Ryde
MathNumSeq is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version.
MathNumSeq is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with MathNumSeq. If not, see <http://www.gnu.org/licenses/>.