|
Math::NumSeq
|
number sequences
|
|
62 |
|
Math::NumSeq::Abundant
|
abundant numbers, greater than sum of divisors
|
|
62 |
|
Math::NumSeq::AlgebraicContinued
|
continued fraction expansion of algebraic numbers
|
|
62 |
|
Math::NumSeq::All
|
all integers
|
|
62 |
|
Math::NumSeq::AllDigits
|
digits of the integers
|
|
62 |
|
Math::NumSeq::AllPrimeFactors
|
prime factors of the integers
|
|
62 |
|
Math::NumSeq::AlmostPrimes
|
semiprimes and other fixed number of prime factors
|
|
62 |
|
Math::NumSeq::AsciiSelf
|
sequence is its own ASCII digits
|
|
62 |
|
Math::NumSeq::BalancedBinary
|
balanced 1,0 bits
|
|
62 |
|
Math::NumSeq::Base::Array
|
|
|
62 |
|
Math::NumSeq::Base::Cache
|
|
|
62 |
|
Math::NumSeq::Base::Digits
|
|
|
62 |
|
Math::NumSeq::Base::IterateIth
|
iterate by calling ith() successively
|
|
62 |
|
Math::NumSeq::Base::IteratePred
|
iterate by searching with pred()
|
|
62 |
|
Math::NumSeq::Base::Sparse
|
|
|
62 |
|
Math::NumSeq::BaumSweet
|
Baum-Sweet sequence
|
|
62 |
|
Math::NumSeq::Beastly
|
numbers containing digits "666"
|
|
62 |
|
Math::NumSeq::Catalan
|
Catalan numbers (2n)! / (n!*(n+1)!)
|
|
62 |
|
Math::NumSeq::CollatzSteps
|
steps in the "3n+1" problem
|
|
62 |
|
Math::NumSeq::ConcatNumbers
|
concatenate digits of i, i+1
|
|
62 |
|
Math::NumSeq::Cubes
|
cubes i**3
|
|
62 |
|
Math::NumSeq::CullenNumbers
|
Cullen numbers i*2^i+1
|
|
62 |
|
Math::NumSeq::DedekindPsiCumulative
|
cumulative Psi function
|
|
62 |
|
Math::NumSeq::DedekindPsiSteps
|
psi function until 2^x*3^y
|
|
62 |
|
Math::NumSeq::DeletablePrimes
|
primes deleting a digit repeatedly
|
|
62 |
|
Math::NumSeq::DigitCount
|
count of a given digit
|
|
62 |
|
Math::NumSeq::DigitCountHigh
|
count of given high digits
|
|
62 |
|
Math::NumSeq::DigitCountLow
|
count of given low digits
|
|
62 |
|
Math::NumSeq::DigitLength
|
length in digits
|
|
62 |
|
Math::NumSeq::DigitLengthCumulative
|
total length in digits of numbers 1 to i
|
|
62 |
|
Math::NumSeq::DigitProduct
|
product of digits
|
|
62 |
|
Math::NumSeq::DigitProductSteps
|
multiplicative persistence and digital root
|
|
62 |
|
Math::NumSeq::DigitSum
|
sum of digits, possibly with powering
|
|
62 |
|
Math::NumSeq::DigitSumModulo
|
digit sum taken modulo a given modulus
|
|
62 |
|
Math::NumSeq::DivisorCount
|
how many divisors
|
|
62 |
|
Math::NumSeq::DuffinianNumbers
|
no common factor with sum of divisors
|
|
62 |
|
Math::NumSeq::Emirps
|
primes backwards and forwards
|
|
62 |
|
Math::NumSeq::ErdosSelfridgeClass
|
Erdos-Selfridge classification of primes
|
|
62 |
|
Math::NumSeq::Even
|
even integers
|
|
62 |
|
Math::NumSeq::Expression
|
mathematical expression values
|
|
62 |
|
Math::NumSeq::Factorials
|
factorials i! = 1*2*...*i
|
|
62 |
|
Math::NumSeq::Fibbinary
|
without consecutive 1-bits
|
|
62 |
|
Math::NumSeq::FibbinaryBitCount
|
number of bits in each fibbinary number
|
|
62 |
|
Math::NumSeq::Fibonacci
|
Fibonacci numbers
|
|
62 |
|
Math::NumSeq::FibonacciWord
|
0/1 related to Fibonacci numbers
|
|
62 |
|
Math::NumSeq::File
|
sequence read from a file
|
|
62 |
|
Math::NumSeq::FractionDigits
|
the digits of a fraction p/q
|
|
62 |
|
Math::NumSeq::GolayRudinShapiro
|
parity of adjacent 11 bit pairs
|
|
62 |
|
Math::NumSeq::GolayRudinShapiroCumulative
|
cumulative Golay/RudinShapiro sequence
|
|
62 |
|
Math::NumSeq::GoldbachCount
|
number of representations as sum of primes P+Q
|
|
62 |
|
Math::NumSeq::GolombSequence
|
sequence is its own run lengths, 1 upwards
|
|
62 |
|
Math::NumSeq::HappyNumbers
|
reaching 1 under repeated sum of squares of digits
|
|
62 |
|
Math::NumSeq::HappySteps
|
number of sum of squares of digits iterations to reach a repeat
|
|
62 |
|
Math::NumSeq::HarshadNumbers
|
numbers divisible by sum of digits
|
|
62 |
|
Math::NumSeq::HofstadterFigure
|
sequence excludes its own first differences
|
|
62 |
|
Math::NumSeq::JugglerSteps
|
steps in the juggler sqrt sequence
|
|
62 |
|
Math::NumSeq::KlarnerRado
|
Klarner-Rado sequences
|
|
62 |
|
Math::NumSeq::Kolakoski
|
sequence of 1s and 2s its own run lengths
|
|
62 |
|
Math::NumSeq::LemoineCount
|
number of representations as P+2*Q for primes P,Q
|
|
62 |
|
Math::NumSeq::LiouvilleFunction
|
Liouville function sequence
|
|
62 |
|
Math::NumSeq::LucasNumbers
|
Lucas numbers
|
|
62 |
|
Math::NumSeq::LuckyNumbers
|
sieved out multiples by the sequence itself
|
|
62 |
|
Math::NumSeq::MaxDigitCount
|
maximum count of a given digit in any radix
|
|
62 |
|
Math::NumSeq::MephistoWaltz
|
Mephisto waltz sequence
|
|
62 |
|
Math::NumSeq::MobiusFunction
|
Mobius function sequence
|
|
62 |
|
Math::NumSeq::Modulo
|
remainders modulo of a given number
|
|
62 |
|
Math::NumSeq::MoranNumbers
|
numbers divided by sum of digits giving a prime
|
|
62 |
|
Math::NumSeq::Multiples
|
multiples of a given number
|
|
62 |
|
Math::NumSeq::NumAronson
|
numerical version of Aronson's sequence
|
|
62 |
|
Math::NumSeq::OEIS
|
number sequence by OEIS A-number
|
|
62 |
|
Math::NumSeq::OEIS::Catalogue
|
available A-numbers
|
|
62 |
|
Math::NumSeq::OEIS::Catalogue::Plugin
|
pluggable catalogue extensions
|
|
62 |
|
Math::NumSeq::OEIS::Catalogue::Plugin::BuiltinTable
|
|
|
62 |
|
Math::NumSeq::OEIS::Catalogue::Plugin::FractionDigits
|
|
|
62 |
|
Math::NumSeq::OEIS::Catalogue::Plugin::ZZ_Files
|
|
|
62 |
|
Math::NumSeq::OEIS::File
|
|
|
62 |
|
Math::NumSeq::Odd
|
odd integers
|
|
62 |
|
Math::NumSeq::Palindromes
|
palindrome numbers like 15351
|
|
62 |
|
Math::NumSeq::Pell
|
Pell numbers
|
|
62 |
|
Math::NumSeq::Perrin
|
Perrin sequence
|
|
62 |
|
Math::NumSeq::PisanoPeriod
|
cycle length of Fibonacci numbers mod i
|
|
62 |
|
Math::NumSeq::PisanoPeriodSteps
|
Fibonacci frequency and Leonardo logarithm
|
|
62 |
|
Math::NumSeq::PolignacObstinate
|
odd integers not prime+2^k
|
|
62 |
|
Math::NumSeq::Polygonal
|
polygonal numbers, triangular, square, pentagonal, etc
|
|
62 |
|
Math::NumSeq::PowerFlip
|
prime exponent flip
|
|
62 |
|
Math::NumSeq::PowerPart
|
largest square root etc divisor
|
|
62 |
|
Math::NumSeq::Powerful
|
numbers with certain prime powers
|
|
62 |
|
Math::NumSeq::PrimeFactorCount
|
how many prime factors
|
|
62 |
|
Math::NumSeq::PrimeIndexOrder
|
order of primeness by primes at prime indexes
|
|
62 |
|
Math::NumSeq::PrimeIndexPrimes
|
primes with prime number indexes
|
|
62 |
|
Math::NumSeq::Primes
|
prime numbers
|
|
62 |
|
Math::NumSeq::Primorials
|
primorials 2*3*...*p[i]
|
|
62 |
|
Math::NumSeq::Pronic
|
pronic numbers
|
|
62 |
|
Math::NumSeq::ProthNumbers
|
Proth number sequence
|
|
62 |
|
Math::NumSeq::PythagoreanHypots
|
hypotenuses of Pythagorean triples
|
|
62 |
|
Math::NumSeq::RadixConversion
|
radix conversion
|
|
62 |
|
Math::NumSeq::RadixWithoutDigit
|
integers without a given digit
|
|
62 |
|
Math::NumSeq::ReReplace
|
sequence of repeated replacements
|
|
62 |
|
Math::NumSeq::ReRound
|
sequence from repeated rounding up
|
|
62 |
|
Math::NumSeq::RepdigitAny
|
numbers which are a repdigit in any radix
|
|
62 |
|
Math::NumSeq::RepdigitRadix
|
radix in which i is a repdigit
|
|
62 |
|
Math::NumSeq::Repdigits
|
repdigits 11, 22, 33, etc
|
|
62 |
|
Math::NumSeq::ReverseAdd
|
steps of the reverse-add algorithm
|
|
62 |
|
Math::NumSeq::ReverseAddSteps
|
steps of the reverse-add algorithm to reach palindrome
|
|
62 |
|
Math::NumSeq::Runs
|
runs of consecutive integers
|
|
62 |
|
Math::NumSeq::SelfLengthCumulative
|
cumulative digit length of own values
|
|
62 |
|
Math::NumSeq::SophieGermainPrimes
|
Sophie Germain primes p and 2*p+1 prime
|
|
62 |
|
Math::NumSeq::SpiroFibonacci
|
recurrence around a square spiral
|
|
62 |
|
Math::NumSeq::SqrtContinued
|
continued fraction expansion of a square root
|
|
62 |
|
Math::NumSeq::SqrtContinuedPeriod
|
period of the continued fraction for sqrt(i)
|
|
62 |
|
Math::NumSeq::SqrtDigits
|
the digits of a square root
|
|
62 |
|
Math::NumSeq::SqrtEngel
|
Engel expansion of a square root
|
|
62 |
|
Math::NumSeq::Squares
|
perfect squares
|
|
62 |
|
Math::NumSeq::StarNumbers
|
star numbers 6*i*(i-1)+1
|
|
62 |
|
Math::NumSeq::SternDiatomic
|
Stern's diatomic sequence
|
|
62 |
|
Math::NumSeq::Tetrahedral
|
tetrahedral numbers i*(i+1)*(i+2)/6
|
|
62 |
|
Math::NumSeq::Totient
|
Euler's totient function, count of coprimes
|
|
62 |
|
Math::NumSeq::TotientCumulative
|
cumulative totients
|
|
62 |
|
Math::NumSeq::TotientPerfect
|
sum of repeated totients is N itself
|
|
62 |
|
Math::NumSeq::TotientSteps
|
count of repeated totients to reach 1
|
|
62 |
|
Math::NumSeq::TotientStepsSum
|
sum of repeated totients to reach 1
|
|
62 |
|
Math::NumSeq::Triangular
|
triangular numbers
|
|
62 |
|
Math::NumSeq::Tribonacci
|
Tribonacci numbers
|
|
62 |
|
Math::NumSeq::TwinPrimes
|
twin primes
|
|
62 |
|
Math::NumSeq::UlamSequence
|
integers uniquely the sum of two previous terms
|
|
62 |
|
Math::NumSeq::UndulatingNumbers
|
numbers with alternating digits ABABAB...
|
|
62 |
|
Math::NumSeq::WoodallNumbers
|
Woodall numbers i*2^i-1
|
|
62 |
(0 Reviews)
[ Rate this distribution ]
