The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Modules

number sequences
all integers
semiprimes and other fixed number of prime factors
sequence is its own ASCII digits
Baum-Sweet sequence
numbers containing digits "666"
steps in the "3n+1" problem
Cullen numbers i*2^i+1
count of a given digit
count of given high digits
count of given low digits
length in digits
total length in digits of numbers 1 to i
product of digits
sum of digits, possibly with powering
digit sum taken modulo a given modulus
how many divisors
primes backwards and forwards
even integers
mathematical expression values
factorials 1*2*...*i
without consecutive 1 bits
number of bits in each fibbinary number
Fibonacci numbers
0/1 related to Fibonacci numbers
the digits of a fraction p/q
sequence is its own run lengths, 1 upwards
reaching 1 under repeated sum of squares of digits
number of sum of squares of digits iterations to reach a repeat
numbers divisible by sum of digits
steps in the juggler sqrt sequence
Klarner-Rado sequences
sequence of 1s and 2s its own run lengths
Liouville function sequence
Mephisto waltz sequence
Mobius function sequence
remainders modulo of a given number
multiples of a given number
numerical version of Aronson's sequence
number sequence by OEIS A-number
available A-numbers
pluggable catalogue extensions
odd integers
palindrome numbers like 15351
Pell numbers
polygonal numbers, triangular, square, pentagonal, etc
how many prime factors
prime numbers
primorials 2*3*...*p[i]
pronic numbers
Proth number sequence
integers without a given digit
numbers which are a repdigit in any radix
radix in which i is a repdigit
repdigits 11, 22, 33, etc
steps of the reverse-add algorithm
steps of the reverse-add algorithm
Sophie Germain primes p and 2*p+1 prime
the digits of a square root
Engel expansion of a square root
perfect squares
star numbers 6*i*(i-1)+1
Stern's diatomic sequence
tetrahedral numbers i*(i+1)*(i+2)/6
Euler's totient function
cumulative totients
sum of repeated totients is N itself
repeated totients to reach 1
triangular numbers
Tribonacci numbers
Woodall numbers i*2^i-1

Provides

in lib/Math/NumSeq/Base/Array.pm
in lib/Math/NumSeq/Base/Digits.pm
in lib/Math/NumSeq/Base/IterateIth.pm
in lib/Math/NumSeq/Base/IteratePred.pm
in lib/Math/NumSeq/Base/Sparse.pm
in lib/Math/NumSeq/Expression.pm
in lib/Math/NumSeq/File.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/BuiltinTable.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/FractionDigits.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/ZZ_Files.pm
in lib/Math/NumSeq/OEIS/File.pm