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 that 1 is divisible only by itself. Then i=2 is divisible by 1 and 2, then for instance 6 is divisible by 4 numbers 1,2,3,6.

FUNCTIONS

$seq = Math::NumSeq::DivisorCount->new ()

$seq = Math::NumSeq::DivisorCount->new (divisors_type => 'propn1')

Create and return a new sequence object.

$value = $seq->ith($i)

Return the number of prime factors in $i.

$bool = $seq->pred($value)

Return true if $value occurs as a divisor count, which means simply $value >= 2.

SEE ALSO

Math::NumSeq, Math::NumSeq::PrimeFactorCount