Sequences
392,541 sequences
- Numbers k such that k^k + k + 1 is prime.A058911
Numbers k such that k^k + k + 1 is prime.
- Numbers k such that k^k + k - 1 is prime.A058912
Numbers k such that k^k + k - 1 is prime.
- Smallest number k such that x/(sum of digits of x) = k has exactly n solutions.A058913
Smallest number k such that x/(sum of digits of x) = k has exactly n solutions.
- Continued fraction expansion of one of four fixed points (mod 1) of Minkowski's question mark function (specifically, the only positive fixed point (mod 1) less than 1/2).A058914
Continued fraction expansion of one of four fixed points (mod 1) of Minkowski's question mark function (specifically, the only positive fixed point (mod 1) less than 1/2).
- Number of graphs with 3 distinct components.A058915
Number of graphs with 3 distinct components.
- Erroneous version of A001500.A058916
Erroneous version of A001500.
- Number of elements required for synthesis of rational function of degree n by "half-n" Miyata method.A058917
Number of elements required for synthesis of rational function of degree n by "half-n" Miyata method.
- Number of elements required for synthesis of rational function of degree n by modified Bott and Duffin method.A058918
Number of elements required for synthesis of rational function of degree n by modified Bott and Duffin method.
- a(n) = n^4/2 - n^3 + 3*n^2/2 - n + 1 = (n^2 + 1)*(n^2 - 2*n + 2)/2.A058919
a(n) = n^4/2 - n^3 + 3*n^2/2 - n + 1 = (n^2 + 1)*(n^2 - 2*n + 2)/2.
- a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.A058920
a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.
- a(n) = round((6*n)!/( 2^(3*n)*(3*n)!*6^(2*n) )).A058921
a(n) = round((6*n)!/( 2^(3*n)*(3*n)!*6^(2*n) )).
- a(n) = n*2^n - 2^n = 2^n*(n-1).A058922
a(n) = n*2^n - 2^n = 2^n*(n-1).
- a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).A058923
a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).
- Number of independent dominating sets in rooted labeled trees with n nodes.A058924
Number of independent dominating sets in rooted labeled trees with n nodes.
- Number of independent dominating sets in labeled trees with n nodes.A058925
Number of independent dominating sets in labeled trees with n nodes.
- Number of independent dominating sets in recursive trees with n nodes.A058926
Number of independent dominating sets in recursive trees with n nodes.
- Numerators of series related to triangular cacti.A058927
Numerators of series related to triangular cacti.
- Denominators of series related to triangular cacti.A058928
Denominators of series related to triangular cacti.
- Number of 2-connected claw-free labeled cubic graphs with 2n nodes.A058929
Number of 2-connected claw-free labeled cubic graphs with 2n nodes.
- Number of 3-connected claw-free cubic graphs with 6n nodes.A058930
Number of 3-connected claw-free cubic graphs with 6n nodes.
- Number of 3-connected claw-free cubic graphs with 2n nodes.A058931
Number of 3-connected claw-free cubic graphs with 2n nodes.
- Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.A058932
Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.
- Let k be bigomega(n) (i.e., n is a k-almost-prime). a(n) = number of k-almost-primes <= n.A058933
Let k be bigomega(n) (i.e., n is a k-almost-prime). a(n) = number of k-almost-primes <= n.
- Numbers k such that 2*5^k + 1 is prime.A058934
Numbers k such that 2*5^k + 1 is prime.
- Concatenation of first n binary numbers.A058935
Concatenation of first n binary numbers.
- Decomposition of Stirling's S(n,2) based on associated numeric partitions.A058936
Decomposition of Stirling's S(n,2) based on associated numeric partitions.
- Maximal exponent of x in all terms of Somos polynomial of order n.A058937
Maximal exponent of x in all terms of Somos polynomial of order n.
- Numbers k such that the sum of the first k digits of the decimal expansion of Pi is prime.A058938
Numbers k such that the sum of the first k digits of the decimal expansion of Pi is prime.
- The elliptic divisibility sequence associated to the rational point of smallest known global height for rational elliptic curves: the curve is [ 0,0,0,-412,3316 ] and the point is [ -18,70 ].A058939
The elliptic divisibility sequence associated to the rational point of smallest known global height for rational elliptic curves: the curve is [ 0,0,0,-412,3316 ] and the point is [ -18,70 ].
- Triangle of coefficients of Euler polynomials rescaled to integers by multiplication with 2^(binary carry sequence (A007814)).A058940
Triangle of coefficients of Euler polynomials rescaled to integers by multiplication with 2^(binary carry sequence (A007814)).
- Numbers k such that 3 + (integer formed from first k digits after decimal point in Pi) is prime.A058941
Numbers k such that 3 + (integer formed from first k digits after decimal point in Pi) is prime.
- Triangle of coefficients of Gandhi polynomials.A058942
Triangle of coefficients of Gandhi polynomials.
- Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.A058943
Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.A058944
Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.
- Coefficients of monic irreducible polynomials over GF(5) listed in lexicographic order.A058945
Coefficients of monic irreducible polynomials over GF(5) listed in lexicographic order.
- Coefficients of monic irreducible polynomials over GF(7) listed in lexicographic order.A058946
Coefficients of monic irreducible polynomials over GF(7) listed in lexicographic order.
- Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.A058947
Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.
- Coefficients of monic irreducible polynomials over GF(4) listed in lexicographic order.A058948
Coefficients of monic irreducible polynomials over GF(4) listed in lexicographic order.
- Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.A058949
Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.
- Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.A058950
Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.
- Coefficients of monic primitive irreducible polynomials over GF(7) listed in lexicographic order.A058951
Coefficients of monic primitive irreducible polynomials over GF(7) listed in lexicographic order.
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.A058952
Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.
- Numbers k of the form k=p*2^x, with p prime and x>=0, such that tau(k)-m = A058933(k) where tau(k) is the number of divisors of k and m is 0 or 1.A058953
Numbers k of the form k=p*2^x, with p prime and x>=0, such that tau(k)-m = A058933(k) where tau(k) is the number of divisors of k and m is 0 or 1.
- Numbers n such that A058933(n)=A058933(n+1).A058954
Numbers n such that A058933(n)=A058933(n+1).
- Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives numerators of s_n.A058955
Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives numerators of s_n.
- Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives denominators of s_n.A058956
Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives denominators of s_n.
- Numbers having at least two representations as b^2 - c^2 with b > c >= 0.A058957
Numbers having at least two representations as b^2 - c^2 with b > c >= 0.
- Numbers k such that 3^k + 4 is prime.A058958
Numbers k such that 3^k + 4 is prime.
- Numbers k such that 3^k - 4 is prime.A058959
Numbers k such that 3^k - 4 is prime.
- Numbers k such that (3^k + 5)/2 is prime.A058960
Numbers k such that (3^k + 5)/2 is prime.