Sequences
392,541 sequences
- Find smallest pair (x,y) such that x^2 - y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of x.A048611
Find smallest pair (x,y) such that x^2 - y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of x.
- Find smallest pair (x,y) such that x^2-y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of y.A048612
Find smallest pair (x,y) such that x^2-y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of y.
- Number of terms (excluding the first) of A002211 for which the geometric mean produces progressively better approximations to Khinchin's constant (itself).A048613
Number of terms (excluding the first) of A002211 for which the geometric mean produces progressively better approximations to Khinchin's constant (itself).
- Number of primes between successive pairs of twin primes.A048614
Number of primes between successive pairs of twin primes.
- Numerator of mass (Sum 1/|Aut(H)|) of Hadamard matrices of order 4n.A048615
Numerator of mass (Sum 1/|Aut(H)|) of Hadamard matrices of order 4n.
- Denominator of mass (Sum 1/|Aut(H)|) of Hadamard matrices of order 4n.A048616
Denominator of mass (Sum 1/|Aut(H)|) of Hadamard matrices of order 4n.
- a(n) = 2*(n!)^2.A048617
a(n) = 2*(n!)^2.
- Even numbers n such that binomial(n,n/2) is divisible by n/2.A048618
Even numbers n such that binomial(n,n/2) is divisible by n/2.
- a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).A048619
a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).
- a(n) is the maximal value of Omega(binomial(n,k)) over k, where Omega = A001222.A048620
a(n) is the maximal value of Omega(binomial(n,k)) over k, where Omega = A001222.
- a(n) = A001222(A001405(n)).A048621
a(n) = A001222(A001405(n)).
- Difference of maximal and central values of A001222 when applied to {C(n,k)} set.A048622
Difference of maximal and central values of A001222 when applied to {C(n,k)} set.
- Binary encoding of semiprimes (A001358).A048623
Binary encoding of semiprimes (A001358).
- Essentially a duplicate of A000129.A048624
Essentially a duplicate of A000129.
- Pisot sequence P(4,6).A048625
Pisot sequence P(4,6).
- Pisot sequence P(6,9).A048626
Pisot sequence P(6,9).
- Numbers m such that the maximal value of A001222(binomial(m,k)) and the central value A001222(A001405(m)) are identical.A048627
Numbers m such that the maximal value of A001222(binomial(m,k)) and the central value A001222(A001405(m)) are identical.
- n-th 4k+1 prime times (n+1)st 4k+3 prime.A048628
n-th 4k+1 prime times (n+1)st 4k+3 prime.
- n-th 6k+1 prime times n-th 6k-1 prime.A048629
n-th 6k+1 prime times n-th 6k-1 prime.
- n-th 4k+1 prime times n-th 4k-1 prime.A048630
n-th 4k+1 prime times n-th 4k-1 prime.
- Xfactorials - like factorials but use carryless GF(2)[ X ] polynomial multiplication.A048631
Xfactorials - like factorials but use carryless GF(2)[ X ] polynomial multiplication.
- Differences between factorials and Xfactorials: A048631 - A000142.A048632
Differences between factorials and Xfactorials: A048631 - A000142.
- Largest squarefree number dividing n-th central binomial coefficient C(n,[ n/2 ]).A048633
Largest squarefree number dividing n-th central binomial coefficient C(n,[ n/2 ]).
- a(n) = a(n-1)*a(n-3) + a(n-2), with a(0)=a(1)=0 and a(2)=1.A048634
a(n) = a(n-1)*a(n-3) + a(n-2), with a(0)=a(1)=0 and a(2)=1.
- Number of rational points of Klein curve over GF(2^n).A048635
Number of rational points of Klein curve over GF(2^n).
- Primes of the form prime^3 + 2.A048636
Primes of the form prime^3 + 2.
- Primes p such that p^3 + 2 is also prime.A048637
Primes p such that p^3 + 2 is also prime.
- Height of lattice of parameters of mixed orthogonal arrays with 2^n runs and strength 2.A048638
Height of lattice of parameters of mixed orthogonal arrays with 2^n runs and strength 2.
- Binary encoding of A006881, numbers with two distinct prime divisors.A048639
Binary encoding of A006881, numbers with two distinct prime divisors.
- Binary encoding of the squarefree numbers, A005117.A048640
Binary encoding of the squarefree numbers, A005117.
- Partial sums of A003188 (Gray code).A048641
Partial sums of A003188 (Gray code).
- Partial products of A003188 (Gray code).A048642
Partial products of A003188 (Gray code).
- Differences between partial products of Gray code (A048642) and factorials (A000142).A048643
Differences between partial products of Gray code (A048642) and factorials (A000142).
- Differences between partial sums of Gray code (A048641) and triangular numbers (A000217).A048644
Differences between partial sums of Gray code (A048641) and triangular numbers (A000217).
- Integers with one or two 1-bits in their binary expansion.A048645
Integers with one or two 1-bits in their binary expansion.
- Primes p such that the decimal digits of p^2 can be partitioned into two or more nonzero squares.A048646
Primes p such that the decimal digits of p^2 can be partitioned into two or more nonzero squares.
- Write n in base 4, then replace each digit '1' with '3' and vice versa and convert back to decimal.A048647
Write n in base 4, then replace each digit '1' with '3' and vice versa and convert back to decimal.
- Order of n-th stable homotopy group of spheres.A048648
Order of n-th stable homotopy group of spheres.
- Decimal expansion of Sum_{m>=0} 1/(2^2^m - 1).A048649
Decimal expansion of Sum_{m>=0} 1/(2^2^m - 1).
- Continued fraction for Sum_{m>=0} 1/(2^2^m - 1).A048650
Continued fraction for Sum_{m>=0} 1/(2^2^m - 1).
- Decimal expansion of Product_{k >= 1} (1 - 1/2^k).A048651
Decimal expansion of Product_{k >= 1} (1 - 1/2^k).
- Continued fraction for Product_{k >= 1} (1-1/2^k) (Cf. A048651).A048652
Continued fraction for Product_{k >= 1} (1-1/2^k) (Cf. A048651).
- Numbers k such that the decimal digits of k^2 can be partitioned into two or more nonzero squares.A048653
Numbers k such that the decimal digits of k^2 can be partitioned into two or more nonzero squares.
- a(n) = 2*a(n-1) + a(n-2); a(0)=1, a(1)=4.A048654
a(n) = 2*a(n-1) + a(n-2); a(0)=1, a(1)=4.
- Generalized Pellian with second term equal to 5.A048655
Generalized Pellian with second term equal to 5.
- a(n) is the number of unitary (and also of squarefree) divisors of n!.A048656
a(n) is the number of unitary (and also of squarefree) divisors of n!.
- Number of non-unitary divisors of n!.A048657
Number of non-unitary divisors of n!.
- Erroneous version of A001111.A048658
Erroneous version of A001111.
- Positions of letters in English alphabet (U.S. pronunciation) that rhyme with 'e'.A048659
Positions of letters in English alphabet (U.S. pronunciation) that rhyme with 'e'.
- Erroneous version of A134997.A048660
Erroneous version of A134997.