Sequences
392,541 sequences
- Numbers of the form 6xy +- x +- y, where x, y are positive integers.A067611
Numbers of the form 6xy +- x +- y, where x, y are positive integers.
- Numbers n such that sigma(n) = 3*phi(sigma(n)).A067612
Numbers n such that sigma(n) = 3*phi(sigma(n)).
- Triangular table of coefficients of the Hermite polynomials, divided by 2^floor(n/2).A067613
Triangular table of coefficients of the Hermite polynomials, divided by 2^floor(n/2).
- a(n) is the second partial quotient in the simple continued fraction for sqrt(prime(n)).A067614
a(n) is the second partial quotient in the simple continued fraction for sqrt(prime(n)).
- Terms in decimal expansion of 1/(17*2^n) before 5882352941176470 (the period with no leading zeros of 1/17) appears.A067615
Terms in decimal expansion of 1/(17*2^n) before 5882352941176470 (the period with no leading zeros of 1/17) appears.
- Continued fraction expansion for Sum_{k>=1} 1/(2^k-1)^2.A067616
Continued fraction expansion for Sum_{k>=1} 1/(2^k-1)^2.
- Continued fraction for 9 * sum( 1/(10^k -1), k=1..0/0 ).A067617
Continued fraction for 9 * sum( 1/(10^k -1), k=1..0/0 ).
- Number of self-conjugate partitions of n into prime parts.A067618
Number of self-conjugate partitions of n into prime parts.
- Total number of parts in all self-conjugate partitions of n. Also, sum of largest parts of all self-conjugate partitions of n.A067619
Total number of parts in all self-conjugate partitions of n. Also, sum of largest parts of all self-conjugate partitions of n.
- a(n) = p^e, where p and e are the rounded means of the prime factors p_i and the exponents e_i, respectively, in the factorization n = p_1^e_1 * ... * p_r^e_r of n into distinct primes p_i. Each mean is rounded to the nearest integer, rounding up if there's a choice.A067620
a(n) = p^e, where p and e are the rounded means of the prime factors p_i and the exponents e_i, respectively, in the factorization n = p_1^e_1 * ... * p_r^e_r of n into distinct primes p_i. Each mean is rounded to the nearest integer, rounding up if there's a choice.
- Let t = coefficient of x^(2n+1) in expansion of sin(x)/(1-x^2); a(n)=denominator(t)-numerator(t).A067621
Let t = coefficient of x^(2n+1) in expansion of sin(x)/(1-x^2); a(n)=denominator(t)-numerator(t).
- Consider the power series (x + 1)^(1/3) = 1 + x/3-x^2/9 + 5x^3/81 + ...; sequence gives numerators of coefficients.A067622
Consider the power series (x + 1)^(1/3) = 1 + x/3-x^2/9 + 5x^3/81 + ...; sequence gives numerators of coefficients.
- Consider the power series (x+1)^(1/3)=1+x/3-x^2/9+5x^3/81+...; sequence gives denominators of coefficients.A067623
Consider the power series (x+1)^(1/3)=1+x/3-x^2/9+5x^3/81+...; sequence gives denominators of coefficients.
- a(n) = 2^(2*n)*(2*n)!.A067624
a(n) = 2^(2*n)*(2*n)!.
- Numbers n such that sigma(n) = phi(prime(n)+1).A067625
Numbers n such that sigma(n) = phi(prime(n)+1).
- a(n) = 2^(2n+1)*(2n+1)!.A067626
a(n) = 2^(2n+1)*(2n+1)!.
- Triangle T(n,k) = number of conjugacy classes of partitions of n using only k types of piles, read by rows.A067627
Triangle T(n,k) = number of conjugacy classes of partitions of n using only k types of piles, read by rows.
- Minimal perimeter of polyiamond with n triangles.A067628
Minimal perimeter of polyiamond with n triangles.
- The average of the prime factors of n, rounded off to the nearest integer (rounding up if there's a choice), with each factor weighted according to its frequency of occurrence in the prime factorization.A067629
The average of the prime factors of n, rounded off to the nearest integer (rounding up if there's a choice), with each factor weighted according to its frequency of occurrence in the prime factorization.
- Denominators in power series for cos(x)*cosh(x).A067630
Denominators in power series for cos(x)*cosh(x).
- If n is composite then a(n) is the standard deviation of the prime factors of n, rounded off to the nearest integer (rounding up if there's a choice), with each factor counted according to its frequency of occurrence in the prime factorization. If n is 1 or prime then a(n)=0.A067631
If n is composite then a(n) is the standard deviation of the prime factors of n, rounded off to the nearest integer (rounding up if there's a choice), with each factor counted according to its frequency of occurrence in the prime factorization. If n is 1 or prime then a(n)=0.
- n(n+180) is a square.A067632
n(n+180) is a square.
- a(1) = 1; sequence of digits of a(n)^2 is a subsequence of the sequence of digits of a(n+1)^2.A067633
a(1) = 1; sequence of digits of a(n)^2 is a subsequence of the sequence of digits of a(n+1)^2.
- a(1) = 1; string of digits of a(n)^2 is a substring of the string of digits of a(n+1)^2.A067634
a(1) = 1; string of digits of a(n)^2 is a substring of the string of digits of a(n+1)^2.
- a(1) = 1; set of digits of a(n)^2 is a proper subset of the set of digits of a(n+1)^2.A067635
a(1) = 1; set of digits of a(n)^2 is a proper subset of the set of digits of a(n+1)^2.
- Row 1 of table in A067640.A067636
Row 1 of table in A067640.
- Row 2 of table in A067640.A067637
Row 2 of table in A067640.
- Row 3 of table in A067640.A067638
Row 3 of table in A067640.
- Row 4 of table in A067640.A067639
Row 4 of table in A067640.
- Table T(n,k) giving number of two-legged knot diagrams with n >= 0 self-intersections and k >= 0 tangencies, read by antidiagonals.A067640
Table T(n,k) giving number of two-legged knot diagrams with n >= 0 self-intersections and k >= 0 tangencies, read by antidiagonals.
- Column 1 of table in A067640.A067641
Column 1 of table in A067640.
- Column 2 of table in A067640.A067642
Column 2 of table in A067640.
- Column 3 of table in A067640.A067643
Column 3 of table in A067640.
- Number of prime alternating tangles (or knots) of type Gamma_1 with two connected components.A067644
Number of prime alternating tangles (or knots) of type Gamma_1 with two connected components.
- Number of prime alternating tangles (or knots) of type Gamma_2 with two connected components.A067645
Number of prime alternating tangles (or knots) of type Gamma_2 with two connected components.
- Number of prime alternating tangles (or knots) with two connected components.A067646
Number of prime alternating tangles (or knots) with two connected components.
- Number of knot diagrams of type 1PI with n crossings and two outgoing strings.A067647
Number of knot diagrams of type 1PI with n crossings and two outgoing strings.
- Number of knot diagrams of type 2PI with n crossings and two outgoing strings.A067648
Number of knot diagrams of type 2PI with n crossings and two outgoing strings.
- Numerators of power series for sqrt(1+x^2)/sqrt(1-x).A067649
Numerators of power series for sqrt(1+x^2)/sqrt(1-x).
- The start of a record-breaking run of consecutive integers with a number of prime factors not equal to 2.A067650
The start of a record-breaking run of consecutive integers with a number of prime factors not equal to 2.
- Numbers k such that sigma(k) = phi(prime(k)-1).A067651
Numbers k such that sigma(k) = phi(prime(k)-1).
- a(n) = H_n(2,3) = H_(n-1)(2,4) where H_n is the n-th hyperoperator.A067652
a(n) = H_n(2,3) = H_(n-1)(2,4) where H_n is the n-th hyperoperator.
- Denominators of the coefficients in exp(x/(1-x)) power series.A067653
Denominators of the coefficients in exp(x/(1-x)) power series.
- Numerators of the coefficients in power series expansion of exp(2x/(1-x)).A067654
Numerators of the coefficients in power series expansion of exp(2x/(1-x)).
- Denominators of the coefficients in exp(2x/(1-x)) power series.A067655
Denominators of the coefficients in exp(2x/(1-x)) power series.
- Numbers n such that n!*B(2n) is an integer, where B(2n) are the Bernoulli numbers.A067656
Numbers n such that n!*B(2n) is an integer, where B(2n) are the Bernoulli numbers.
- Prime values of A001008, the numerators of the harmonic numbers.A067657
Prime values of A001008, the numerators of the harmonic numbers.
- Odd integers k such that k = gcd(((k-1)/2)!+1, ((k-1)/2)^((k-1)/2)+1).A067658
Odd integers k such that k = gcd(((k-1)/2)!+1, ((k-1)/2)^((k-1)/2)+1).
- Number of partitions of n into distinct parts such that number of parts is odd.A067659
Number of partitions of n into distinct parts such that number of parts is odd.
- Values of gcd(k!+1,2^k+1) not equal to 1 taking k in increasing order.A067660
Values of gcd(k!+1,2^k+1) not equal to 1 taking k in increasing order.