Sequences
392,541 sequences
- Number of nodes at the n-th level of the Inverse-Totient-Tree (ITT) with the root at 1, and edges connecting number m to all numbers k such that phi(k) = m.A058811
Number of nodes at the n-th level of the Inverse-Totient-Tree (ITT) with the root at 1, and edges connecting number m to all numbers k such that phi(k) = m.
- Irregular triangle of rows of numbers in increasing order. Row 1 = {1}. Row m + 1 contains all numbers k such that phi(k) is in row m.A058812
Irregular triangle of rows of numbers in increasing order. Row 1 = {1}. Row m + 1 contains all numbers k such that phi(k) is in row m.
- Unlabeled (i.e., equivalent to their 1-0 complement) binary necklaces sorted in ascending lexicographic order and read as binary numbers.A058813
Unlabeled (i.e., equivalent to their 1-0 complement) binary necklaces sorted in ascending lexicographic order and read as binary numbers.
- Numbers k such that k divides the number of digits of k!.A058814
Numbers k such that k divides the number of digits of k!.
- Numerators in expansion of exp(exp(x)-1)/(2-x).A058815
Numerators in expansion of exp(exp(x)-1)/(2-x).
- Denominators in expansion of exp(exp(x)-1)/(2-x).A058816
Denominators in expansion of exp(exp(x)-1)/(2-x).
- Even cototient numbers.A058817
Even cototient numbers.
- a(0) = 1, a(1) = 3; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(3), i.e., a(n) = 3^n - A027376(n).A058818
a(0) = 1, a(1) = 3; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(3), i.e., a(n) = 3^n - A027376(n).
- a(0) = 1, a(1) = 4; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(4), i.e., a(n) = 4^n - A027377(n).A058819
a(0) = 1, a(1) = 4; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(4), i.e., a(n) = 4^n - A027377(n).
- a(0) = 1, a(1) = 5; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(5), i.e., a(n) = 5^n - A001692(n).A058820
a(0) = 1, a(1) = 5; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(5), i.e., a(n) = 5^n - A001692(n).
- Dimensions of homogeneous subspaces of shuffle algebra over 6-letter alphabet (see A058766 for 2-letter case).A058821
Dimensions of homogeneous subspaces of shuffle algebra over 6-letter alphabet (see A058766 for 2-letter case).
- a(0) = 1, a(1) = 7; for n>=2 a(n) is the number of degree-n monic reducible polynomials over GF(7), i.e., a(n) = 7^n - A001693(n).A058822
a(0) = 1, a(1) = 7; for n>=2 a(n) is the number of degree-n monic reducible polynomials over GF(7), i.e., a(n) = 7^n - A001693(n).
- a(0) = 1, a(1) = 8; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(8), i.e., a(n) = 8^n - A027380(n).A058823
a(0) = 1, a(1) = 8; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(8), i.e., a(n) = 8^n - A027380(n).
- a(0) = 1, a(1) = 9; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(9), i.e., a(n) = 9^n - A027381(n).A058824
a(0) = 1, a(1) = 9; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(9), i.e., a(n) = 9^n - A027381(n).
- Numbers which are both totients and cototients.A058825
Numbers which are both totients and cototients.
- Even cototient numbers which are nontotients.A058826
Even cototient numbers which are nontotients.
- Totients which are not cototients.A058827
Totients which are not cototients.
- Numbers k such that 6^k + k is prime.A058828
Numbers k such that 6^k + k is prime.
- Numbers k such that 6^k - k is prime.A058829
Numbers k such that 6^k - k is prime.
- Number of labeled n-node 4-valent graphs containing a single double edge.A058830
Number of labeled n-node 4-valent graphs containing a single double edge.
- Number of labeled n-node 4-valent graphs containing two nonadjacent double edges.A058831
Number of labeled n-node 4-valent graphs containing two nonadjacent double edges.
- Number of labeled n-node 4-valent graphs containing two adjacent double edges.A058832
Number of labeled n-node 4-valent graphs containing two adjacent double edges.
- Number of labeled n-node 4-valent graphs containing 3 double edges, a distinguished unordered pair of which are adjacent.A058833
Number of labeled n-node 4-valent graphs containing 3 double edges, a distinguished unordered pair of which are adjacent.
- Number of labeled n-node 4-valent graphs containing a triple edge.A058834
Number of labeled n-node 4-valent graphs containing a triple edge.
- Number of labeled n-node 4-valent graphs containing a triple edge and a double edge.A058835
Number of labeled n-node 4-valent graphs containing a triple edge and a double edge.
- Number of labeled n-node 4-valent graphs containing a loop.A058836
Number of labeled n-node 4-valent graphs containing a loop.
- Number of labeled n-node 4-valent graphs containing a loop and a double edge.A058837
Number of labeled n-node 4-valent graphs containing a loop and a double edge.
- a(n) = 1 + sum of the anti-divisors of n.A058838
a(n) = 1 + sum of the anti-divisors of n.
- Expansion of (1-x^5)*Product_{r>=3} (1-x^r).A058839
Expansion of (1-x^5)*Product_{r>=3} (1-x^r).
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives y(0), y(1), ...A058840
From Renyi's "beta expansion of 1 in base 3/2": sequence gives y(0), y(1), ...
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives lengths of runs of 0's in A058840.A058841
From Renyi's "beta expansion of 1 in base 3/2": sequence gives lengths of runs of 0's in A058840.
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.A058842
From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.
- Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).A058843
Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).
- Number of ways of placing n labeled balls into 4 indistinguishable boxes with at least 2 balls in each box.A058844
Number of ways of placing n labeled balls into 4 indistinguishable boxes with at least 2 balls in each box.
- Numbers n such that the sum of the first n odd primes is palindromic.A058845
Numbers n such that the sum of the first n odd primes is palindromic.
- Numbers k such that the sum of odd primes up to k is palindromic.A058846
Numbers k such that the sum of odd primes up to k is palindromic.
- Palindromes that are the sum of consecutive initial odd primes.A058847
Palindromes that are the sum of consecutive initial odd primes.
- Numbers k such that the sum of the first k odd composites is palindromic.A058848
Numbers k such that the sum of the first k odd composites is palindromic.
- Sum of odd composites up to n is palindromic.A058849
Sum of odd composites up to n is palindromic.
- Palindromes that are the sum of consecutive initial odd composites.A058850
Palindromes that are the sum of consecutive initial odd composites.
- Sum of even composites up to n is palindromic.A058851
Sum of even composites up to n is palindromic.
- Palindromes n such that n and n^2 have same digit sum.A058852
Palindromes n such that n and n^2 have same digit sum.
- Primes p such that x^43 = 2 has a solution mod p.A058853
Primes p such that x^43 = 2 has a solution mod p.
- a(n) = largest prime in the factorization of n-th Franel number (A000172).A058854
a(n) = largest prime in the factorization of n-th Franel number (A000172).
- Number of 6-bead necklaces where each bead is an unlabeled rooted tree, by total number of nodes.A058855
Number of 6-bead necklaces where each bead is an unlabeled rooted tree, by total number of nodes.
- Numbers k that divide the sum of the partition numbers to k.A058856
Numbers k that divide the sum of the partition numbers to k.
- Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(7).A058857
Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(7).
- Numbers k that divide the sum of the first k unique partition numbers (A000009).A058858
Numbers k that divide the sum of the first k unique partition numbers (A000009).
- Number of 1-connected rooted cubic planar maps with n faces.A058859
Number of 1-connected rooted cubic planar maps with n faces.
- Number of 2-connected rooted cubic planar maps with n faces.A058860
Number of 2-connected rooted cubic planar maps with n faces.