Category:Integer sequences
![]() | Computing portal |
Here is a list of articles in the Integer sequences category of the Computing portal that unifies foundations of mathematics and computations using computers. This category includes not only articles about certain types of integer sequences, but also articles about theorems and conjectures pertaining to, and properties of, integer sequences.
Subcategories
This category has the following 6 subcategories, out of 6 total.
B
F
P
R
T
Pages in category "Integer sequences"
The following 200 pages are in this category, out of 209 total.
(previous page) (next page)- Integer sequence (computing)
*
- Journal of Integer Sequences (computing)
- List of integer sequences (computing)
- List of OEIS sequences (computing)
- On-Line Encyclopedia of Integer Sequences (computing)
3
- 3x + 1 semigroup (computing)
A
- Abundant number (computing)
- Achilles number (computing)
- Alcuin's sequence (computing)
- Almost perfect number (computing)
- Almost prime (computing)
- Alternating factorial (computing)
- Amicable numbers (computing)
- Amicable triple (computing)
- Arithmetic number (computing)
- Automatic sequence (computing)
B
- Ban number (computing)
- Beatty sequence (computing)
- Behrend sequence (computing)
- Bell number (computing)
- Bernoulli number (computing)
- Betrothed numbers (computing)
- Binomial coefficient (computing)
- Blum integer (computing)
- Boustrophedon transform (computing)
C
- Calkin–Wilf tree (computing)
- Carmichael number (computing)
- Carol number (computing)
- Catalan number (computing)
- Collatz conjecture (computing)
- Colossally abundant number (computing)
- Complete sequence (computing)
- Composite number (computing)
- Congruum (computing)
- Constant-recursive sequence (computing)
- Cube (algebra) (computing)
- Cullen number (computing)
D
- Dedekind number (computing)
- Deficient number (computing)
- Delannoy number (computing)
- Derangement (computing)
- Descartes number (computing)
- Dirichlet series inversion (computing)
- Divisibility sequence (computing)
- Divisor sum identities (computing)
- Double factorial (computing)
- Double Mersenne number (computing)
E
- Eighth power (computing)
- Elliptic divisibility sequence (computing)
- Equidigital number (computing)
- Erdős–Nicolas number (computing)
- Erdős–Woods number (computing)
- Ergodic sequence (computing)
- Euclid number (computing)
- Euclid–Mullin sequence (computing)
- Euler number (computing)
- Euler numbers (computing)
- Eulerian number (computing)
- Evil number (computing)
- Exponential factorial (computing)
- Extravagant number (computing)
F
- Factorial prime (computing)
- Fermat number (computing)
- Fifth power (algebra) (computing)
- Figurate number (computing)
- Fortunate number (computing)
- Fourth power (computing)
- Fractal sequence (computing)
- Friendly number (computing)
- Frugal number (computing)
G
- Genocchi number (computing)
- Giuga number (computing)
- Göbel's sequence (computing)
- Golomb sequence (computing)
- Gould's sequence (computing)
- Greedy algorithm for Egyptian fractions (computing)
- Gregory coefficients (computing)
H
- Harmonic divisor number (computing)
- Hemiperfect number (computing)
- Hermite number (computing)
- Highly abundant number (computing)
- Highly composite number (computing)
- Highly cototient number (computing)
- Highly powerful number (computing)
- Highly totient number (computing)
- Hilbert number (computing)
- Hofstadter sequence (computing)
- Home prime (computing)
- Hyperperfect number (computing)
I
- Idoneal number (computing)
- Integer complexity (computing)
- Interprime (computing)
- Irrationality sequence (computing)
J
- Jacobsthal number (computing)
- Juggler sequence (computing)
K
- K-regular sequence (computing)
- Katydid sequence (computing)
- Kolakoski sequence (computing)
- Kostka number (computing)
- Kynea number (computing)
L
- Lah number (computing)
- Lambek–Moser theorem (computing)
- Large set (combinatorics) (computing)
- Lazy caterer's sequence (computing)
- Lehmer sequence (computing)
- Leonardo number (computing)
- Leyland number (computing)
- Lobb number (computing)
- Loeschian number (computing)
- Lucas chain (computing)
- Lucas number (computing)
- Lucas sequence (computing)
- Lucas–Carmichael number (computing)
- Lucky number (computing)
- Lucky numbers of Euler (computing)
M
- Magic constant (computing)
- Meander (mathematics) (computing)
- Ménage problem (computing)
- Mersenne number (computing)
- Mersenne prime (computing)
- Mian–Chowla sequence (computing)
- Moser–de Bruijn sequence (computing)
- Motzkin number (computing)
- Multiplicative partition (computing)
- Multiply perfect number (computing)
N
- Narayana number (computing)
- Noncototient (computing)
- Nonhypotenuse number (computing)
- Nontotient (computing)
O
- Odious number (computing)
- Ordered Bell number (computing)
P
- Padovan sequence (computing)
- Partition function (number theory) (computing)
- Pell number (computing)
- Perfect number (computing)
- Perfect power (computing)
- Perfect totient number (computing)
- Pernicious number (computing)
- Perrin number (computing)
- Pillai sequence (computing)
- Polite number (computing)
- Poly-Bernoulli number (computing)
- Power of 10 (computing)
- Power of two (computing)
- Powerful number (computing)
- Practical number (computing)
- Primary pseudoperfect number (computing)
- Prime number (computing)
- Prime omega function (computing)
- Primefree sequence (computing)
- Primitive abundant number (computing)
- Primitive permutation group (computing)
- Primitive semiperfect number (computing)
- Primorial (computing)
- Primorial prime (computing)
- Pronic number (computing)
- Proth number (computing)
Q
- Quasiperfect number (computing)
R
- Recamán's sequence (computing)
- Refactorable number (computing)
- Regular number (computing)
- Rough number (computing)
S
- Schröder number (computing)
- Schröder–Hipparchus number (computing)
- Semiperfect number (computing)
- Semiprime (computing)
- Seventh power (computing)
- Singly and doubly even (computing)
- Sixth power (computing)
- Smooth number (computing)
- Sociable number (computing)
- Somos sequence (computing)
- Sorting number (computing)
- Sparsely totient number (computing)
- Sphenic number (computing)
- Spt function (computing)
- Square number (computing)
- Square triangular number (computing)
- Square-free integer (computing)
- Squared triangular number (computing)
- Stanley sequence (computing)
- Stirling number (computing)
- Størmer number (computing)
- Strictly non-palindromic number (computing)
- Strobogrammatic number (computing)
- Sublime number (computing)
- Sum-free sequence (computing)
- Super-Poulet number (computing)
- Superabundant number (computing)
- Superior highly composite number (computing)
- Superperfect number (computing)
- Sylvester's sequence (computing)
T
- Telephone number (mathematics) (computing)
- Thabit number (computing)
- Triangular number (computing)
U
- Ulam number (computing)
- Unitary perfect number (computing)
- Untouchable number (computing)
- Unusual number (computing)
W
- Weak ordering (computing)