Modules

largest square etc divisor
square free integers
divide out any square factor
number sequences
abundant numbers, greater than sum of divisors
all integers
digits of the 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
concatenate digits i, i+1
Cullen numbers i*2^i+1
cumulative Psi function
psi function until 2^x*3^y
primes deleting a digit repeatedly
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
sequence read from a file
the digits of a fraction p/q
number of representations as sum of primes 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
sequence excludes its own first differences
steps in the juggler sqrt sequence
Klarner-Rado sequences
sequence of 1s and 2s its own run lengths
number of representations as P+2*Q for primes P,Q
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
Perrin sequence
odd integers not prime+2^k
polygonal numbers, triangular, square, pentagonal, etc
largest square root etc divisor
numbers with certain prime powers
how many prime factors
prime numbers
primorials 2*3*...*p[i]
pronic numbers
Proth number sequence
hypotenuses of Pythagorean triples
integers without a given digit
sequence of repeated replacements
sequence from repeated rounding up
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 to reach palindrome
runs of consecutive integers
Sophie Germain primes p and 2*p+1 prime
continued fraction expansion of a square root
period of the continued fraction for sqrt(i)
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, count of coprimes
cumulative totients
sum of repeated totients is N itself
count of repeated totients to reach 1
sum of repeated totients to reach 1
triangular numbers
Tribonacci numbers
integers uniquely the sum of two previous terms
numbers with alternating digits ABABAB...
Woodall numbers i*2^i-1

Provides

in devel/Base4Only01.pm
in devel/old/Base4Without3.pm
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 devel/old/ChampernowneBinary.pm
in devel/old/ChampernowneBinaryLsb.pm
in lib/Math/NumSeq/Expression.pm
in devel/old/FractionBits.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/BuiltinTable.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/FractionDigits.pm
in devel/OeisCatalogue-SqrtDigits.pm
in lib/Math/NumSeq/OEIS/Catalogue/Plugin/ZZ_Files.pm
in lib/Math/NumSeq/OEIS/File.pm
in devel/old/Pentagonal.pm
in devel/old/PentagonalGeneralized.pm
in devel/old/PentagonalSecond.pm
in devel/SafePrimes.pm
in devel/old/SemiPrimesOdd.pm
in devel/old/TernaryWithout2.pm
in devel/old/ThueMorse.pm
in devel/old/ThueMorseEvil.pm
in devel/old/ThueMorseOdious.pm