Sequences
392,541 sequences
- Card-matching numbers (Dinner-Diner matching numbers).A059061
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059062
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059063
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059064
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059065
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059066
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059067
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059068
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059069
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers).A059070
Card-matching numbers (Dinner-Diner matching numbers).
- Card-matching numbers (Dinner-Diner matching numbers) for 5 kinds of cards.A059071
Card-matching numbers (Dinner-Diner matching numbers) for 5 kinds of cards.
- Duplicate of A000459.A059072
Duplicate of A000459.
- Card-matching numbers (Dinner-Diner matching numbers).A059073
Card-matching numbers (Dinner-Diner matching numbers).
- Number of derangements of a multiset comprising 4 repeats of an n-element set.A059074
Number of derangements of a multiset comprising 4 repeats of an n-element set.
- Numbers k such that 2*7^k + 3 is prime.A059075
Numbers k such that 2*7^k + 3 is prime.
- Number of pairs of orientable necklaces with n beads and two colors; i.e., turning the necklace over does not leave it unchanged.A059076
Number of pairs of orientable necklaces with n beads and two colors; i.e., turning the necklace over does not leave it unchanged.
- Numbers k such that 2*7^k - 3 is prime.A059077
Numbers k such that 2*7^k - 3 is prime.
- Number of orientable necklaces with 2n beads and two colors which when turned over produce their own color complement.A059078
Number of orientable necklaces with 2n beads and two colors which when turned over produce their own color complement.
- Number of n-element T_0-antichains on a labeled set.A059079
Number of n-element T_0-antichains on a labeled set.
- Triangle A(n,m) of numbers of n-element T_0-antichains on a labeled m-set, m=0,...,2^n.A059080
Triangle A(n,m) of numbers of n-element T_0-antichains on a labeled m-set, m=0,...,2^n.
- Number of 5-element T_0-antichains on a labeled n-set, n=0,..,32.A059081
Number of 5-element T_0-antichains on a labeled n-set, n=0,..,32.
- Number of 6-element T_0-antichains on a labeled n-set, n = 0, ..., 64.A059082
Number of 6-element T_0-antichains on a labeled n-set, n = 0, ..., 64.
- Number of T_0-antichains on a labeled n-set.A059083
Number of T_0-antichains on a labeled n-set.
- Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge included), m=0,1,...,2^n.A059084
Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge included), m=0,1,...,2^n.
- Number of labeled n-node T_0-hypergraphs without multiple hyperedges (empty hyperedge included).A059085
Number of labeled n-node T_0-hypergraphs without multiple hyperedges (empty hyperedge included).
- Number of labeled T_0-hypergraphs with n distinct hyperedges (empty hyperedge included).A059086
Number of labeled T_0-hypergraphs with n distinct hyperedges (empty hyperedge included).
- Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge excluded), m=0,1,...,2^n-1.A059087
Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge excluded), m=0,1,...,2^n-1.
- Number of labeled n-node T_0-hypergraphs without multiple hyperedges (empty hyperedge excluded).A059088
Number of labeled n-node T_0-hypergraphs without multiple hyperedges (empty hyperedge excluded).
- Number of labeled T_0-hypergraphs with n distinct hyperedges (empty hyperedge excluded).A059089
Number of labeled T_0-hypergraphs with n distinct hyperedges (empty hyperedge excluded).
- Triangle T(n,m) giving number of m-element intersecting antichains on a labeled n-set or n-variable Boolean functions with m nonzero values in the Post class F(7,2), m=0,.., A037952(n).A059090
Triangle T(n,m) giving number of m-element intersecting antichains on a labeled n-set or n-variable Boolean functions with m nonzero values in the Post class F(7,2), m=0,.., A037952(n).
- Numbers k such that 3*7^k - 2 is prime.A059091
Numbers k such that 3*7^k - 2 is prime.
- Zeroless pandigitals expressible as a product of five factors that concatenate to another zeroless pandigital.A059092
Zeroless pandigitals expressible as a product of five factors that concatenate to another zeroless pandigital.
- Numbers ending with the letter "e" (in English).A059093
Numbers ending with the letter "e" (in English).
- Numbers whose sum of digits is a cube.A059094
Numbers whose sum of digits is a cube.
- List consisting of the representation of n in base 3 using digits -1, 0, 1.A059095
List consisting of the representation of n in base 3 using digits -1, 0, 1.
- Numbers n such that 405*n^8 + 108*n^6 + 27*n^4 + 6*n^2 + 1 is prime.A059096
Numbers n such that 405*n^8 + 108*n^6 + 27*n^4 + 6*n^2 + 1 is prime.
- Numbers n such that the binomial coefficient C(2n,n) is not divisible by the square of an odd prime.A059097
Numbers n such that the binomial coefficient C(2n,n) is not divisible by the square of an odd prime.
- Triangle read by rows. T(n, k) = Sum_{i=0..n} Stirling2(n, i)*Product_{j=1..k} (i - j + 1) for 0 <= k <= n.A059098
Triangle read by rows. T(n, k) = Sum_{i=0..n} Stirling2(n, i)*Product_{j=1..k} (i - j + 1) for 0 <= k <= n.
- Expansion of exp(exp(x)-1)/(2-exp(x)).A059099
Expansion of exp(exp(x)-1)/(2-exp(x)).
- a(n) = n^2 + 2.A059100
a(n) = n^2 + 2.
- Number of terms of the fractional part of A001203 for which the geometric mean produces increasingly better approximations to Khinchin's constant.A059101
Number of terms of the fractional part of A001203 for which the geometric mean produces increasingly better approximations to Khinchin's constant.
- Number of terms of the fractional part of A030168 for which the geometric mean produces increasingly better approximations to Khinchin's constant.A059102
Number of terms of the fractional part of A030168 for which the geometric mean produces increasingly better approximations to Khinchin's constant.
- Number of simple, connected, unit-distance graphs on n points realizable in the plane with straight edges all of the same length; lines are permitted to cross.A059103
Number of simple, connected, unit-distance graphs on n points realizable in the plane with straight edges all of the same length; lines are permitted to cross.
- Number of Bieberbach groups in dimension n: torsion-free crystallographic groups.A059104
Number of Bieberbach groups in dimension n: torsion-free crystallographic groups.
- Number of n-dimensional torsion-free crystallographic groups with trivial center.A059105
Number of n-dimensional torsion-free crystallographic groups with trivial center.
- Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem.A059106
Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem.
- Number of solutions to triples version of Langford (or Langford-Skolem) problem.A059107
Number of solutions to triples version of Langford (or Langford-Skolem) problem.
- Number of solutions to variant of triples version of Langford (or Langford-Skolem) problem.A059108
Number of solutions to variant of triples version of Langford (or Langford-Skolem) problem.
- Numbers m such that m*phi(m)-1 is prime, where phi is the Euler function (A000010).A059109
Numbers m such that m*phi(m)-1 is prime, where phi is the Euler function (A000010).
- Triangle T = A007318*A271703; T(n,m)= Sum_{i=0..n} L'(n,i)*binomial(i,m), m=0..n.A059110
Triangle T = A007318*A271703; T(n,m)= Sum_{i=0..n} L'(n,i)*binomial(i,m), m=0..n.