id	name	description	id_mathworld	id_metamath	id_msc	id_planetmath	id_wikidata	id_wikipedia_en	display_type	id_template	name_template	description_template	parameters	added_by	category	certifiable	stats_total_constants	stats_exact_values	stats_bounded	stats_half_bounded	stats_unbounded	stats_current_bounds	stats_verified_bounds	stats_attested_bounds	stats_source_bounds	stats_via_bounds	stats_unsourced_bounds	stats_last_improvement	id_oeis
ramsey	Ramsey numbers	The Ramsey number $R(r,s)$ is the smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_r$ in the first color or a monochromatic $K_s$ in the second color.	RamseyNumber	df-ram	05D10	RamseyNumbers	Q16424100	Ramsey_number	grid	ramsey-{r}-{s}	Ramsey number $R({r},{s})$	The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{{{r}}}$ in the first color or a monochromatic $K_{{{s}}}$ in the second color.	['r', 's']	daniel-munro	05D Extremal combinatorics	True	76	9	67	0	0	152	57	1	94	0	0	2026-11-11	
square-packing	Packing unit squares in a square	$s(n)$ is the side of the smallest square into which $n$ unit squares can be packed.	SquarePacking		52C15		Q7582076	Square_packing	sequence	square-packing-in-square-{n}	Packing unit squares in a square $s({n})$	The side of the smallest square into which ${n}$ unit squares can be packed.	['n']	daniel-munro	52C Discrete geometry	True	100	35	65	0	0	200	109	0	91	0	0	2026-09	
busy-beaver-shift	Busy beaver shift function	The busy beaver shift function $BB(n)$, also written $S(n)$, is the maximum number of steps made by an $n$-state, 2-symbol Turing machine that halts when started on a blank tape.	BusyBeaver		03D10		Q1427965	Busy_beaver	sequence	busy-beaver-shift-{n}	Busy beaver shift function $BB({n})$	The maximum number of steps made by a ${n}$-state, 2-symbol Turing machine that halts when started on a blank tape.	['n']	daniel-munro	03D Computability and recursion theory	True	7	5	0	2	0	12	5	0	5	2	0	2025-06-25	A060843
busy-beaver-ones	Busy beaver ones function	The busy beaver ones function $\Sigma(n)$ (Radó's sigma function) is the maximum number of 1s left on the tape by an $n$-state, 2-symbol Turing machine that halts when started on a blank tape.	BusyBeaver		03D10		Q1427965	Busy_beaver	sequence	busy-beaver-ones-{n}	Busy beaver ones function $\Sigma({n})$	The maximum number of 1s left on the tape by a ${n}$-state, 2-symbol Turing machine that halts when started on a blank tape.	['n']	daniel-munro	03D Computability and recursion theory	True	7	5	0	2	0	12	5	0	5	2	0	2025-06-25	A028444
kissing-number	Kissing numbers	The kissing number of $\mathbb{R}^n$ is the maximum number of non-overlapping unit spheres that can touch a central unit sphere in $\mathbb{R}^n$.	KissingNumber		52C17		Q1371530	Kissing_number	sequence	kissing-number-{n}	Kissing number for $\mathbb{{R}}^{{{n}}}$	The maximum number of non-overlapping unit spheres that can touch a central unit sphere in $\mathbb{{R}}^{{{n}}}$.	['n']	daniel-munro	52C Discrete geometry	True	24	6	18	0	0	48	14	0	34	0	0	2026-11-14	
degree-diameter	Degree-diameter problem	$N(d,k)$ is the largest possible number of vertices in a graph of maximum degree $d$ and diameter at most $k$.	Degree-DiameterProblem		05C35		Q5251835	Degree_diameter_problem	grid	degree-diameter-{d}-{k}	Degree-diameter problem $N({d},{k})$	The largest possible number of vertices in a graph of maximum degree ${d}$ and diameter at most ${k}$.	['d', 'k']	daniel-munro	05C Graph theory	True	162	7	155	0	0	324	59	0	265	0	0	2026-11-16	
cage	Cages	$n(k,g)$ is the order of a $(k,g)$-cage, a $k$-regular graph of girth $g$ with the fewest possible vertices.	CageGraph		05C35			Cage_(graph_theory)	grid	cage-{k}-{g}	Cage order $n({k},{g})$	The order of a $({k},{g})$-cage, a ${k}$-regular graph of girth ${g}$ with the fewest possible vertices.	['k', 'g']	daniel-munro	05C Graph theory	True	252	83	169	0	0	504	163	0	266	75	0	2026-11-11	
debruijn-newman	de Bruijn–Newman constant	The de Bruijn–Newman constant $\Lambda$ is defined via the zeros of a certain function $H(\lambda,z)$, where $\lambda$ is a real parameter and $z$ is a complex variable. More precisely, $H(\lambda, z):=\int_{0}^{\infty} e^{\lambda u^{2}} \Phi(u) \cos (z u) \, du$, where $\Phi$ is the super-exponentially decaying function $\Phi(u) = \sum_{n=1}^{\infty} (2\pi^2n^4e^{9u}-3\pi n^2 e^{5u} ) e^{-\pi n^2 e^{4u}}$ and $\Lambda$ is the unique real number with the property that $H(\lambda, \cdot)$ has only real zeros if and only if $\lambda\geq \Lambda$. The Riemann hypothesis is equivalent to $\Lambda \le 0$.	deBruijn-NewmanConstant		11M26		Q2248459	De_Bruijn–Newman_constant	single				[]	daniel-munro	11M Zeta and L-functions: analytic theory	True	1	0	1	0	0	2	0	0	2	0	0	2021-01-22	
van-der-waerden	Van der Waerden numbers	$W(r,k)$ is the smallest number $n$ such that if the integers $1$ to $n$ are colored with $r$ colors, there must be a monochromatic arithmetic progression of length $k$.	vanderWaerdenNumber		05D10		Q7913892	Van_der_Waerden_number	grid	van-der-waerden-{r}-{k}	Van der Waerden number $W({r},{k})$	The smallest number $n$ such that if the integers $1$ to $n$ are colored with ${r}$ colors, there must be a monochromatic arithmetic progression of length ${k}$.	['r', 'k']	daniel-munro	05D Extremal combinatorics	True	45	7	38	0	0	90	24	0	66	0	0	2022-11-20	
stamp-folding	Stamp folding	$s(n)$ is the number of ways to fold a strip of $n$ stamps, hinged where they meet, into a pile one stamp in size, counted by the order of the stamps in the pile.	StampFolding				Q6753749	Map_folding	sequence	stamp-folding-{n}	Stamp folding $s({n})$	The number of ways to fold a strip of ${n}$ stamps into a pile one stamp in size, counted by the order of the stamps in the pile.	['n']	daniel-munro	05A Enumerative combinatorics	True	29	29	0	0	0	58	16	0	0	42	0		A000136
map-folding	Map folding	The number of ways to fold an $m \times n$ map, creased along the lines of its grid of unit squares, into a pile one square in size, counted by the order of the squares in the pile.	MapFolding				Q6753749	Map_folding	grid	map-folding-{m}-{n}	Map folding $({m} \times {n})$	The number of ways to fold a ${m} \times {n}$ map along its creases into a pile one square in size, counted by the order of the squares in the pile.	['m', 'n']	daniel-munro	05A Enumerative combinatorics	True	87	42	45	0	0	174	79	0	60	35	0	2026-11-16	A001418
disk-covering	Covering a disk with disks	$r(n)$ is the smallest radius such that $n$ disks of that radius can cover the unit disk, of radius 1.	DiskCoveringProblem		52C15			Disk_covering_problem	sequence	disk-covering-{n}	Covering a disk with ${n}$ disks	The smallest radius such that ${n}$ disks of that radius can cover the unit disk, of radius 1.	['n']	daniel-munro	52C Discrete geometry	True	25	20	5	0	0	50	12	0	38	0	0	2026-11-16	
circle-in-equilateral	Circle packing in an equilateral triangle	The side length of the smallest equilateral triangle into which $n$ unit circles (of radius 1) can be packed.			52C15			Circle_packing_in_an_equilateral_triangle	sequence	circle-in-equilateral-{n}	Packing ${n}$ unit circles in an equilateral triangle	The side length of the smallest equilateral triangle into which ${n}$ unit circles (of radius 1) can be packed.	['n']	daniel-munro	52C Discrete geometry	True	15	15	0	0	0	30	22	0	8	0	0	2020-09-02	
circle-in-square	Circle packing in a square	$s(n)$ is the side of the smallest square into which $n$ unit circles (of radius 1) can be packed. Equivalently, $s(n) = 2 + 2/d_n$, where $d_n$ is the largest possible minimum distance between $n$ points in a unit square.			52C15			Circle_packing_in_a_square	sequence	circle-in-square-{n}	Packing ${n}$ unit circles in a square	The side of the smallest square into which ${n}$ unit circles (of radius 1) can be packed.	['n']	daniel-munro	52C Discrete geometry	True	36	34	2	0	0	72	30	0	40	2	0	2021-09-29	
minimal-superpermutation	Minimal superpermutations	$L(n)$ is the length of the shortest string that contains each permutation of $n$ symbols as a contiguous substring.			05A05		Q17048413	Superpermutation	sequence	minimal-superpermutation-{n}	Minimal superpermutation length $L({n})$	The length of the shortest string that contains each permutation of ${n}$ symbols as a contiguous substring.	['n']	daniel-munro	05A Enumerative combinatorics	True	9	5	4	0	0	18	10	0	6	2	0	2026-10-22	A180632
affine-line-arrangements	Arrangements of lines in the affine plane	The number of combinatorially different arrangements of $n$ lines in the plane, where lines may be parallel and more than two may meet at a point. Two arrangements are the same if a homeomorphism of the plane, which may reverse its orientation, takes the lines of one to the lines of the other.							sequence	affine-line-arrangements-{n}	Arrangements of ${n}$ lines in the affine plane	The number of combinatorially different arrangements of ${n}$ lines in the plane, which may be parallel or meet more than two at a point.	['n']	daniel-munro	52C Discrete geometry	True	12	7	5	0	0	24	11	0	9	4	0	2026-11-16	A241600
affine-line-arrangements-general-position	Arrangements of lines in general position	The number of combinatorially different arrangements of $n$ lines in general position in the plane: no two parallel and no three through a point. Two arrangements are the same if a homeomorphism of the plane, which may reverse its orientation, takes the lines of one to the lines of the other.							sequence	affine-line-arrangements-general-position-{n}	Arrangements of ${n}$ lines in general position	The number of combinatorially different arrangements of ${n}$ lines in the plane with no two parallel and no three through a point.	['n']	daniel-munro	52C Discrete geometry	True	12	9	3	0	0	24	10	0	8	6	0	2026-11-11	A090338
golomb-ruler	Optimal Golomb rulers	A Golomb ruler is a set of integer marks such that no two pairs of marks are the same distance apart. $G(n)$ is the shortest length of a Golomb ruler with $n$ marks.	GolombRuler		05B10			Golomb_ruler	sequence	golomb-ruler-{n}	Optimal Golomb ruler $G({n})$	The shortest length of a Golomb ruler with ${n}$ marks: a set of ${n}$ integers such that no two pairs of them are the same distance apart.	['n']	daniel-munro	05B Designs and configurations	True	30	28	2	0	0	60	36	0	24	0	0	2026-11-15	A003022
schur	Schur numbers	The Schur number $S(k)$ is the largest number $n$ such that the integers $1$ to $n$ can be colored with $k$ colors with no monochromatic solution to $x + y = z$.	SchurNumber		05D10			Schur_number	sequence	schur-{k}	Schur number $S({k})$	The largest number $n$ such that the integers $1$ to $n$ can be colored with ${k}$ colors with no monochromatic solution to $x + y = z$.	['k']	daniel-munro	05D Extremal combinatorics	True	9	5	4	0	0	18	11	0	7	0	0	2026-11-04	A045652
weak-schur	Weak Schur numbers	The weak Schur number $WS(k)$ is the largest number $n$ such that the integers $1$ to $n$ can be colored with $k$ colors with no monochromatic solution to $x + y = z$ with $x \neq y$.							sequence	weak-schur-{k}	Weak Schur number $WS({k})$	The largest number $n$ such that the integers $1$ to $n$ can be colored with ${k}$ colors with no monochromatic solution to $x + y = z$ with $x \neq y$.	['k']	daniel-munro	05D Extremal combinatorics	True	9	4	5	0	0	18	12	0	6	0	0	2026-11-08	A072842
snake-in-the-box	Snake-in-the-box	A snake in the $n$-dimensional hypercube is an induced path: a path whose vertices are adjacent only when they're consecutive on the path. $s(n)$ is the length, in edges, of the longest snake in the $n$-dimensional hypercube.			05C38			Snake-in-the-box	sequence	snake-in-the-box-{n}	Snake-in-the-box $s({n})$	The length, in edges, of the longest induced path in the ${n}$-dimensional hypercube.	['n']	daniel-munro	05C Graph theory	True	13	8	5	0	0	26	19	0	7	0	0	2026-11-11	A099155
coil-in-the-box	Coil-in-the-box	A coil in the $n$-dimensional hypercube is an induced cycle: a cycle whose vertices are adjacent only when they're consecutive around the cycle. $c(n)$ is the length, in edges, of the longest coil in the $n$-dimensional hypercube.			05C38				sequence	coil-in-the-box-{n}	Coil-in-the-box $c({n})$	The length, in edges, of the longest induced cycle in the ${n}$-dimensional hypercube.	['n']	daniel-munro	05C Graph theory	True	12	7	5	0	0	24	13	0	11	0	0	2026-08-29	A000937
cap-set	Cap sets	A cap set is a set of points in the $n$-dimensional affine space $\mathbb{F}_3^n$ with no three on a line, or equivalently no three distinct points $x, y, z$ with $x + y + z = 0$. In the card game SET, it's a collection of cards with no set among them. $r(n)$ is the size of the largest cap set in $\mathbb{F}_3^n$.			51E22		Q28455422	Cap_set	sequence	cap-set-{n}	Cap set $r({n})$	The size of the largest set of points in $\mathbb{{F}}_3^{{{n}}}$ with no three on a line.	['n']	daniel-munro	51E Finite geometry and special incidence structures	True	8	6	2	0	0	16	9	0	7	0	0	2023-12-14	A090245
no-three-in-line	No-three-in-line problem	$D(n)$ is the largest number of points of the $n \times n$ grid that can be chosen with no three on a line, in any direction. Since each row holds at most two of them, $D(n) \le 2n$. It's conjectured that $D(n) < 2n$ for all large $n$.	No-Three-in-a-LineProblem		52C10		Q6580594	No-three-in-line_problem	sequence	no-three-in-line-{n}	No-three-in-line $D({n})$	The largest number of points of the ${n} \times {n}$ grid with no three on a line.	['n']	daniel-munro	52C Discrete geometry	True	78	76	2	0	0	156	156	0	0	0	0	2026-11-05	A272651
isosceles-set	Isosceles sets	An isosceles set is a set of points in which every three points form an isosceles triangle. $i(n)$ is the size of the largest isosceles set in the $n$-dimensional Euclidean space $\mathbb{R}^n$. Erdős asked for $i(3)$ in 1946.			52C10		Q55614672		sequence	isosceles-set-{n}	Isosceles set $i({n})$	The size of the largest set of points in $\mathbb{{R}}^{{{n}}}$ in which every three points form an isosceles triangle.	['n']	daniel-munro	52C Discrete geometry	True	12	12	0	0	0	24	12	0	12	0	0	2026-11-02	A175769
sorting-network-size	Smallest sorting networks	A sorting network on $n$ inputs is a sequence of comparators, each of which joins two of $n$ wires and puts the smaller of their two values on the first wire and the larger on the second, that sorts every input. $S(n)$ is the smallest number of comparators in a sorting network on $n$ inputs.			68P10			Sorting_network	sequence	sorting-network-size-{n}	Smallest sorting network $S({n})$	The smallest number of comparators in a sorting network on ${n}$ inputs.	['n']	daniel-munro	68P Theory of data	True	32	12	20	0	0	64	34	0	30	0	0	2026-10-19	A003075
sorting-network-depth	Fastest sorting networks	A sorting network on $n$ inputs is a sequence of comparators, each of which joins two of $n$ wires and puts the smaller of their two values on the first wire and the larger on the second, that sorts every input. Comparators on different wires can act at the same time, so a network acts in steps, or layers, of comparators on disjoint wires. $D(n)$ is the smallest number of steps, or depth, of a sorting network on $n$ inputs.			68P10			Sorting_network	sequence	sorting-network-depth-{n}	Fastest sorting network $D({n})$	The smallest depth, or number of parallel steps, of a sorting network on ${n}$ inputs.	['n']	daniel-munro	68P Theory of data	True	32	17	15	0	0	64	34	0	30	0	0	2025-11-06	A067782
rectilinear-crossing	Rectilinear crossing number of the complete graph	The rectilinear crossing number $\overline{\mathrm{cr}}(K_n)$ is the fewest crossings in a drawing of the complete graph $K_n$ in the plane with straight edges and no three vertices on a line. Two edges cross exactly when their four ends are in convex position, so it is also the fewest convex quadrilaterals spanned by $n$ points in general position.	RectilinearCrossingNumber		52C10			Crossing_number_(graph_theory)	sequence	rectilinear-crossing-{n}	Rectilinear crossing number $\overline{{\mathrm{{cr}}}}(K_{{{n}}})$	The fewest crossings in a drawing of the complete graph $K_{{{n}}}$ in the plane with straight edges and no three vertices on a line.	['n']	daniel-munro	52C Discrete geometry	True	96	24	72	0	0	192	25	0	145	22	0	2015-05-26	A014540
multicolor-ramsey-triangle	Multicolor Ramsey numbers for triangles	The multicolor Ramsey number $R_k(3) = R(3,3,\ldots,3)$ is the smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $k$ colors contains a monochromatic triangle. A coloring of $1, \ldots, m$ with no monochromatic solution to $x + y = z$ colors the edges of $K_{m+1}$ with no monochromatic triangle, by coloring the edge $uv$ with the color of $\lvert u - v \rvert$, so $R_k(3) \ge S(k) + 2$, where $S(k)$ is the Schur number.			05D10			Ramsey's_theorem	sequence	multicolor-ramsey-triangle-{k}	Multicolor Ramsey number $R_{{{k}}}(3)$	The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with ${k}$ colors contains a monochromatic triangle.	['k']	daniel-munro	05D Extremal combinatorics	True	7	1	6	0	0	14	6	0	8	0	0	2026-11-13	A003323
chromatic-number-space	Chromatic number of Euclidean space	The chromatic number $\chi(\mathbb{R}^n)$ of $n$-dimensional Euclidean space is the fewest colors needed to color the points of $\mathbb{R}^n$ so that no two points at distance exactly 1 have the same color. For the plane, finding it is the Hadwiger–Nelson problem. By the de Bruijn–Erdős theorem, it is the largest chromatic number of a finite unit-distance graph in $\mathbb{R}^n$ (assuming the axiom of choice), so lower bounds come from such graphs that can't be colored with fewer colors, and upper bounds from colorings of the whole space, often by tiling it with cells of diameter just under 1.	Hadwiger-NelsonProblem		52C10		Q1383936	Hadwiger–Nelson_problem	sequence	chromatic-number-space-{n}	Chromatic number $\chi(\mathbb{{R}}^{{{n}}})$	The fewest colors needed to color the points of $\mathbb{{R}}^{{{n}}}$ so that no two points at distance exactly 1 have the same color.	['n']	daniel-munro	52C Discrete geometry	True	11	0	11	0	0	22	0	2	20	0	0	2026-10-11	
