Sequences
392,541 sequences
- Number of 3-connected rooted cubic planar maps with n faces and girth at least 4.A058861
Number of 3-connected rooted cubic planar maps with n faces and girth at least 4.
- Number of chordal labeled graphs (connected or not) with n nodes.A058862
Number of chordal labeled graphs (connected or not) with n nodes.
- Number of connected labeled chordal graphs on n nodes with no induced path P_4; also the number of labeled trees with each vertex replaced by a clique.A058863
Number of connected labeled chordal graphs on n nodes with no induced path P_4; also the number of labeled trees with each vertex replaced by a clique.
- Number of labeled chordal graphs (connected or not) on n nodes with no induced path P_4.A058864
Number of labeled chordal graphs (connected or not) on n nodes with no induced path P_4.
- Irregular table a(n,k) = number of connected labeled chordal graphs on n nodes with k edges, containing no induced path P_4, for n >= 1, 1 <= k <= n*(n-1)/2, read by rows; also the number of labeled trees with each vertex replaced by a clique.A058865
Irregular table a(n,k) = number of connected labeled chordal graphs on n nodes with k edges, containing no induced path P_4, for n >= 1, 1 <= k <= n*(n-1)/2, read by rows; also the number of labeled trees with each vertex replaced by a clique.
- Number of 2-trees rooted at an edge.A058866
Number of 2-trees rooted at an edge.
- Equidistant lonely primes. Each prime is the same distance (gap) from the preceding prime and the next prime. These distances are maximal: each distance is larger than all such previous distances.A058867
Equidistant lonely primes. Each prime is the same distance (gap) from the preceding prime and the next prime. These distances are maximal: each distance is larger than all such previous distances.
- Maximal distances of equidistant lonely primes shown in A058867.A058868
Maximal distances of equidistant lonely primes shown in A058867.
- Duplicate of A054342.A058869
Duplicate of A054342.
- Number of 2-trees rooted at an asymmetric edge.A058870
Number of 2-trees rooted at an asymmetric edge.
- Sum of next n primes (A007468) is prime for odd n or half the sum is prime for even n.A058871
Sum of next n primes (A007468) is prime for odd n or half the sum is prime for even n.
- Number of 2-colored labeled graphs with n nodes.A058872
Number of 2-colored labeled graphs with n nodes.
- Number of 3-colored labeled graphs with n nodes.A058873
Number of 3-colored labeled graphs with n nodes.
- Number of 4-colored labeled graphs with n nodes.A058874
Number of 4-colored labeled graphs with n nodes.
- Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1 <= k <= n).A058875
Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1 <= k <= n).
- Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).A058876
Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).
- Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.A058877
Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.
- Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).A058878
Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).
- Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).A058879
Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).
- a(n) = (1/(2n)) * Sum_{d|n} phi(d) * 2^(2n/d) + (2^((n-4)/2), if n is even).A058880
a(n) = (1/(2n)) * Sum_{d|n} phi(d) * 2^(2n/d) + (2^((n-4)/2), if n is even).
- Erroneous version of A051504.A058881
Erroneous version of A051504.
- Erroneous version of A000665.A058882
Erroneous version of A000665.
- The "Wild Numbers", from the novel of the same title (Version 1).A058883
The "Wild Numbers", from the novel of the same title (Version 1).
- Partial sums of the partition function (A000041), with the last term subtracted. Also the sum of the row of the character table for S_n corresponding to the partition n-1,1 for n>1. Also the sum over all partitions lambda of n of one less than the number of 1's in lambda.A058884
Partial sums of the partition function (A000041), with the last term subtracted. Also the sum of the row of the character table for S_n corresponding to the partition n-1,1 for n>1. Also the sum over all partitions lambda of n of one less than the number of 1's in lambda.
- a(n) = smallest k such that k! ends in 2^n, not counting the trailing zeros.A058885
a(n) = smallest k such that k! ends in 2^n, not counting the trailing zeros.
- Sum of the row of the character table of S_n corresponding to the partition 2,1^{n-2}.A058886
Sum of the row of the character table of S_n corresponding to the partition 2,1^{n-2}.
- Smallest prime p such that (2^n)*p is a nontotient number.A058887
Smallest prime p such that (2^n)*p is a nontotient number.
- Number of terms in the set invphi(2*prime(n)), where prime(n) is the n-th prime.A058888
Number of terms in the set invphi(2*prime(n)), where prime(n) is the n-th prime.
- Arrange binary trees in natural sequential order (see examples); sequence gives numbers of nodes.A058889
Arrange binary trees in natural sequential order (see examples); sequence gives numbers of nodes.
- Smallest number of nodes in a graph whose automorphism group is cyclic of order n.A058890
Smallest number of nodes in a graph whose automorphism group is cyclic of order n.
- a(n) = 2^(2^(n-1) - 1).A058891
a(n) = 2^(2^(n-1) - 1).
- E.g.f.: exp(f(x)-1), where f(x) = o.g.f. for partitions (A000041), Product_{k>=1} 1/(1-x^k).A058892
E.g.f.: exp(f(x)-1), where f(x) = o.g.f. for partitions (A000041), Product_{k>=1} 1/(1-x^k).
- Triangle arising in enumeration of maps on projective plane.A058893
Triangle arising in enumeration of maps on projective plane.
- Squarefree semiprimes A006881(m) such that |A006881(m)-A007304(m)| = 1.A058894
Squarefree semiprimes A006881(m) such that |A006881(m)-A007304(m)| = 1.
- a(n) = n^4 - n.A058895
a(n) = n^4 - n.
- a(n) = 4^n - 4.A058896
a(n) = 4^n - 4.
- An unknown sequence: several people have asked about this, so it has been added to the database.A058897
An unknown sequence: several people have asked about this, so it has been added to the database.
- Inconsummate numbers in base 2: no number is this multiple of the sum of its digits (in base 2).A058898
Inconsummate numbers in base 2: no number is this multiple of the sum of its digits (in base 2).
- Inconsummate numbers in base 3: no number is this multiple of the sum of its digits (in base 3).A058899
Inconsummate numbers in base 3: no number is this multiple of the sum of its digits (in base 3).
- Inconsummate numbers in base 4: no number is this multiple of the sum of its digits (in base 4).A058900
Inconsummate numbers in base 4: no number is this multiple of the sum of its digits (in base 4).
- Inconsummate numbers in base 5: no number is this multiple of the sum of its digits (in base 5).A058901
Inconsummate numbers in base 5: no number is this multiple of the sum of its digits (in base 5).
- Inconsummate numbers in base 6: no number is this multiple of the sum of its digits (in base 6).A058902
Inconsummate numbers in base 6: no number is this multiple of the sum of its digits (in base 6).
- Inconsummate numbers in base 7: no number is this multiple of the sum of its digits (in base 7).A058903
Inconsummate numbers in base 7: no number is this multiple of the sum of its digits (in base 7).
- Inconsummate numbers in base 8: no number is this multiple of the sum of its digits (in base 8).A058904
Inconsummate numbers in base 8: no number is this multiple of the sum of its digits (in base 8).
- Inconsummate numbers in base 9: no number is this multiple of the sum of its digits (in base 9).A058905
Inconsummate numbers in base 9: no number is this multiple of the sum of its digits (in base 9).
- Inconsummate numbers in base 11: no number is this multiple of the sum of its digits (in base 11).A058906
Inconsummate numbers in base 11: no number is this multiple of the sum of its digits (in base 11).
- Inconsummate numbers in base 12: no number is this multiple of the sum of its digits (in base 12).A058907
Inconsummate numbers in base 12: no number is this multiple of the sum of its digits (in base 12).
- Six prime numbers in arithmetic progression with a common difference of 9876543210.A058908
Six prime numbers in arithmetic progression with a common difference of 9876543210.
- Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in base 10.A058909
Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in base 10.
- Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).A058910
Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).