Sequences
392,541 sequences
- McKay-Thompson series of class 84a for Monster.A058761
McKay-Thompson series of class 84a for Monster.
- McKay-Thompson series of class 87A for Monster.A058762
McKay-Thompson series of class 87A for Monster.
- Integers which are neither totient nor cototient.A058763
Integers which are neither totient nor cototient.
- Smallest number x such that cototient(x) = 2^n.A058764
Smallest number x such that cototient(x) = 2^n.
- Primes of the form 3^k - 2^k.A058765
Primes of the form 3^k - 2^k.
- a(0) = 1, a(1) = 2; for n>=2 a(n) is the number of degree-n reducible polynomials over GF(2).A058766
a(0) = 1, a(1) = 2; for n>=2 a(n) is the number of degree-n reducible polynomials over GF(2).
- Numbers k such that k*2^(k/2) + 1 is prime.A058767
Numbers k such that k*2^(k/2) + 1 is prime.
- McKay-Thompson series of class 94A for the Monster group.A058768
McKay-Thompson series of class 94A for the Monster group.
- McKay-Thompson series of class 95A for Monster.A058769
McKay-Thompson series of class 95A for Monster.
- Numbers k such that k * (1+i)^k + 1 is a Gaussian prime.A058770
Numbers k such that k * (1+i)^k + 1 is a Gaussian prime.
- Numbers k such that k * (1+i)^k - 1 is a Gaussian prime.A058771
Numbers k such that k * (1+i)^k - 1 is a Gaussian prime.
- Numbers k such that k * (1+i)^k - i is a Gaussian prime.A058772
Numbers k such that k * (1+i)^k - i is a Gaussian prime.
- McKay-Thompson series of class 105A for Monster.A058773
McKay-Thompson series of class 105A for Monster.
- McKay-Thompson series of class 110A for Monster.A058774
McKay-Thompson series of class 110A for Monster.
- Numbers n such that n * 2^(n/2) - 1 is prime.A058775
Numbers n such that n * 2^(n/2) - 1 is prime.
- McKay-Thompson series of class 119A for Monster.A058776
McKay-Thompson series of class 119A for Monster.
- Numbers n such that n^2*2^n + n*2^((n + 1)/2) + 1 is prime.A058777
Numbers n such that n^2*2^n + n*2^((n + 1)/2) + 1 is prime.
- Numbers n such that n^2*2^n - n*2^((n + 1)/2) + 1 is prime.A058778
Numbers n such that n^2*2^n - n*2^((n + 1)/2) + 1 is prime.
- Even numbers n such that n^2*2^n + 1 is prime.A058779
Even numbers n such that n^2*2^n + 1 is prime.
- Numbers k such that k^2 * 2^k + 1 is prime.A058780
Numbers k such that k^2 * 2^k + 1 is prime.
- Numbers k such that k^2 * 2^k - 1 is prime.A058781
Numbers k such that k^2 * 2^k - 1 is prime.
- n * (1+i)^n + i is a Gaussian prime.A058782
n * (1+i)^n + i is a Gaussian prime.
- Number of n-rowed binary matrices with all row sums 4, up to row and column permutation; bipartite graphs with all nodes of degree 4 in a distinguished bipartite n-block, up to isomorphism.A058783
Number of n-rowed binary matrices with all row sums 4, up to row and column permutation; bipartite graphs with all nodes of degree 4 in a distinguished bipartite n-block, up to isomorphism.
- Number of n-rowed binary matrices with all row sums 5, up to row and column permutation; bipartite graphs with all nodes of degree 5 in a distinguished bipartite n-block, up to isomorphism.A058784
Number of n-rowed binary matrices with all row sums 5, up to row and column permutation; bipartite graphs with all nodes of degree 5 in a distinguished bipartite n-block, up to isomorphism.
- Number of n-rowed binary matrices with all row sums 6, up to row and column permutation; bipartite graphs with all nodes of degree 6 in a distinguished bipartite n-block, up to isomorphism.A058785
Number of n-rowed binary matrices with all row sums 6, up to row and column permutation; bipartite graphs with all nodes of degree 6 in a distinguished bipartite n-block, up to isomorphism.
- Number of n-hedra with 2n-5 vertices or 3n-7 edges (the vertices of these are all of degree 3, except one which is of degree 4). Alternatively, the number of polyhedra with n vertices whose faces are all triangular, except one which is tetragonal.A058786
Number of n-hedra with 2n-5 vertices or 3n-7 edges (the vertices of these are all of degree 3, except one which is of degree 4). Alternatively, the number of polyhedra with n vertices whose faces are all triangular, except one which is tetragonal.
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).A058787
Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.A058788
Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.
- Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).A058789
Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 3 subsets of the cover and that intersection of every 3 subsets of the cover contains at most one point.A058790
Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 3 subsets of the cover and that intersection of every 3 subsets of the cover contains at most one point.
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 4 subsets of the cover and that intersection of every 4 subsets of the cover contains at most one point.A058791
Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 4 subsets of the cover and that intersection of every 4 subsets of the cover contains at most one point.
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 5 subsets of the cover and that intersection of every 5 subsets of the cover contains at most one point.A058792
Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 5 subsets of the cover and that intersection of every 5 subsets of the cover contains at most one point.
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 6 subsets of the cover and that intersection of every 6 subsets of the cover contains at most one point.A058793
Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 6 subsets of the cover and that intersection of every 6 subsets of the cover contains at most one point.
- Row 3 of A007754.A058794
Row 3 of A007754.
- Row 4 of A007754.A058795
Row 4 of A007754.
- Row 5 of A007754.A058796
Row 5 of A007754.
- a(n) = n*a(n-1) - a(n-2), with a(-1) = 0, a(0) = 1.A058797
a(n) = n*a(n-1) - a(n-2), with a(-1) = 0, a(0) = 1.
- a(n) = n*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.A058798
a(n) = n*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.
- Column 2 of A007754.A058799
Column 2 of A007754.
- Vertically indecomposable lattices on n unlabeled nodes.A058800
Vertically indecomposable lattices on n unlabeled nodes.
- Number of connected vertically indecomposable partial lattices on n unlabeled nodes.A058801
Number of connected vertically indecomposable partial lattices on n unlabeled nodes.
- Vertically decomposable lattices on n unlabeled nodes.A058802
Vertically decomposable lattices on n unlabeled nodes.
- Vertically indecomposable lattices on n labeled nodes.A058803
Vertically indecomposable lattices on n labeled nodes.
- Number of labeled vertically indecomposable lattices with a fixed bottom.A058804
Number of labeled vertically indecomposable lattices with a fixed bottom.
- Number of labeled vertically indecomposable lattices with a fixed top and bottom.A058805
Number of labeled vertically indecomposable lattices with a fixed top and bottom.
- a(n) = n! * H_n(n) where H_0(n) = 1/n, H_m(n) = Sum_{k=1..n} H_{m-1}(k).A058806
a(n) = n! * H_n(n) where H_0(n) = 1/n, H_m(n) = Sum_{k=1..n} H_{m-1}(k).
- a(n) = Product_{k=1..n} s(n,k), where s(n,k) is unsigned Stirling number of the first kind. (s(n,k) = number of permutations of n elements which contain exactly k cycles.)A058807
a(n) = Product_{k=1..n} s(n,k), where s(n,k) is unsigned Stirling number of the first kind. (s(n,k) = number of permutations of n elements which contain exactly k cycles.)
- Product{k=1 to n}[S(n,k)], where S(n,k) is a Stirling number of the second kind. (S(n,k) = number of ways of partitioning a set of n elements into k nonempty subsets.)A058808
Product{k=1 to n}[S(n,k)], where S(n,k) is a Stirling number of the second kind. (S(n,k) = number of ways of partitioning a set of n elements into k nonempty subsets.)
- The sequence lambda(3,n), where lambda is defined in A055203. Number of ways of placing n identifiable positive intervals with a total of exactly three starting and/or finishing points.A058809
The sequence lambda(3,n), where lambda is defined in A055203. Number of ways of placing n identifiable positive intervals with a total of exactly three starting and/or finishing points.
- The sequence lambda(n,n), where lambda is defined in A055203.A058810
The sequence lambda(n,n), where lambda is defined in A055203.