Sequences
392,541 sequences
- Decimal expansion of log_2(9).A020861
Decimal expansion of log_2(9).
- Decimal expansion of log_2(10).A020862
Decimal expansion of log_2(10).
- Decimal expansion of log_2(11).A020863
Decimal expansion of log_2(11).
- Decimal expansion of log(12)/log(2).A020864
Decimal expansion of log(12)/log(2).
- Number of forests in Moebius ladder M_n.A020865
Number of forests in Moebius ladder M_n.
- Number of strong edge-subgraphs in Moebius ladder M_n.A020866
Number of strong edge-subgraphs in Moebius ladder M_n.
- Number of forests with no isolated vertices in Moebius ladder M_n.A020867
Number of forests with no isolated vertices in Moebius ladder M_n.
- Number of single component edge-subgraphs in Moebius ladder M_n.A020868
Number of single component edge-subgraphs in Moebius ladder M_n.
- Number of single component forests in Moebius ladder M_n.A020869
Number of single component forests in Moebius ladder M_n.
- Number of strong single-component edge-subgraphs in Moebius ladder M_n.A020870
Number of strong single-component edge-subgraphs in Moebius ladder M_n.
- Number of spanning trees in a Moebius ladder M_n with 2n vertices.A020871
Number of spanning trees in a Moebius ladder M_n with 2n vertices.
- Number of restricted forests in Moebius ladder M_n.A020872
Number of restricted forests in Moebius ladder M_n.
- a(n) is number of cycles in Moebius ladder M_n.A020873
a(n) is number of cycles in Moebius ladder M_n.
- Number of paths in Moebius ladder M_n.A020874
Number of paths in Moebius ladder M_n.
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.A020875
Number of (undirected) Hamiltonian paths in n-Moebius ladder.
- a(n) = ((5+sqrt(5))/2)^n + ((5-sqrt(5))/2)^n.A020876
a(n) = ((5+sqrt(5))/2)^n + ((5-sqrt(5))/2)^n.
- Number of matchings in Moebius ladder M_n.A020877
Number of matchings in Moebius ladder M_n.
- Number of maximum matchings in the n-Moebius ladder M_n.A020878
Number of maximum matchings in the n-Moebius ladder M_n.
- Number of elementary edge-subgraphs in Moebius ladder M_n.A020879
Number of elementary edge-subgraphs in Moebius ladder M_n.
- Number of strong elementary edge-subgraphs in Moebius ladder M_n.A020880
Number of strong elementary edge-subgraphs in Moebius ladder M_n.
- Number of strong restricted edge-subgraphs in Moebius ladder M_n.A020881
Number of strong restricted edge-subgraphs in Moebius ladder M_n.
- Ordered hypotenuses (with multiplicity) of primitive Pythagorean triangles.A020882
Ordered hypotenuses (with multiplicity) of primitive Pythagorean triangles.
- Ordered long legs of primitive Pythagorean triangles.A020883
Ordered long legs of primitive Pythagorean triangles.
- Ordered short legs of primitive Pythagorean triangles.A020884
Ordered short legs of primitive Pythagorean triangles.
- Ordered areas (divided by 6) of primitive Pythagorean triangles (with multiple entries).A020885
Ordered areas (divided by 6) of primitive Pythagorean triangles (with multiple entries).
- Ordered semiperimeters of primitive Pythagorean triangles.A020886
Ordered semiperimeters of primitive Pythagorean triangles.
- Ordered set of a + b - c as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.A020887
Ordered set of a + b - c as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.
- Ordered set of (a + b - c)/2 as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.A020888
Ordered set of (a + b - c)/2 as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.
- Ordered set of b + c - a as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.A020889
Ordered set of b + c - a as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.
- Ordered set of (b + c - a)/2 as (a,b,c) runs through all primitive Pythagorean triples with a < b < c.A020890
Ordered set of (b + c - a)/2 as (a,b,c) runs through all primitive Pythagorean triples with a < b < c.
- Ordered set of c + a - b as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.A020891
Ordered set of c + a - b as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.
- Ordered set of (c + a - b)/2 as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.A020892
Ordered set of (c + a - b)/2 as (a,b,c) runs through all primitive Pythagorean triples with a<b<c.
- Squarefree sums of two squares; or squarefree numbers with no prime factors of the form 4k+3.A020893
Squarefree sums of two squares; or squarefree numbers with no prime factors of the form 4k+3.
- Nonnegative numbers that are sums of two nonzero cubes.A020894
Nonnegative numbers that are sums of two nonzero cubes.
- Cubefree sums of two nonzero cubes.A020895
Cubefree sums of two nonzero cubes.
- Positive numbers k such that k = x^5 + y^5 has a solution in nonzero integers x, y.A020896
Positive numbers k such that k = x^5 + y^5 has a solution in nonzero integers x, y.
- Sum of two nonzero rational cubes.A020897
Sum of two nonzero rational cubes.
- Positive cubefree integers n such that the Diophantine equation X^3 + Y^3 = n*Z^3 has solutions.A020898
Positive cubefree integers n such that the Diophantine equation X^3 + Y^3 = n*Z^3 has solutions.
- Numbers k with an odd number of terms in their Zeckendorf representation (write k as a sum of non-consecutive distinct Fibonacci numbers).A020899
Numbers k with an odd number of terms in their Zeckendorf representation (write k as a sum of non-consecutive distinct Fibonacci numbers).
- Greatest k such that k-th prime < twice n-th prime.A020900
Greatest k such that k-th prime < twice n-th prime.
- Greatest k such that k-th prime < 3 times n-th prime.A020901
Greatest k such that k-th prime < 3 times n-th prime.
- Number of nonisomorphic cyclic subgroups of alternating group A_n (or number of distinct orders of even permutations of n objects); number of different LCM's of partitions of n which have even number of even parts.A020902
Number of nonisomorphic cyclic subgroups of alternating group A_n (or number of distinct orders of even permutations of n objects); number of different LCM's of partitions of n which have even number of even parts.
- Lim f(f(...f(n))) where f is the fractal sequence given by f(n)=A002260(n+1).A020903
Lim f(f(...f(n))) where f is the fractal sequence given by f(n)=A002260(n+1).
- Positions of 2 in A020903; complement of A191777.A020904
Positions of 2 in A020903; complement of A191777.
- Sum of n plus its prime factors associated with A020700.A020905
Sum of n plus its prime factors associated with A020700.
- Triangle where n-th row is the first n terms of the sequence in reverse order, starting with a(1) = 1 and a(2) = 2.A020906
Triangle where n-th row is the first n terms of the sequence in reverse order, starting with a(1) = 1 and a(2) = 2.
- Position of n-th 2 in A020906.A020907
Position of n-th 2 in A020906.
- Number of terms in Zeckendorf representation of 2^n.A020908
Number of terms in Zeckendorf representation of 2^n.
- Number of bits in the base-2 representation of the n-th Fibonacci number.A020909
Number of bits in the base-2 representation of the n-th Fibonacci number.
- Number of terms in Zeckendorf representation of 3^n.A020910
Number of terms in Zeckendorf representation of 3^n.