Sequences
392,541 sequences
- Coefficients in a 10-adic square root of 1.A091661
Coefficients in a 10-adic square root of 1.
- Duplicate of A063006.A091662
Duplicate of A063006.
- 10-adic integer x=.....93380022607743740081787109375 satisfying x^3 = x.A091663
10-adic integer x=.....93380022607743740081787109375 satisfying x^3 = x.
- 10-adic integer x=.....06619977392256259918212890624 satisfying x^3 = x.A091664
10-adic integer x=.....06619977392256259918212890624 satisfying x^3 = x.
- Triangle read by rows: T(n,k) is the number of nonseparable planar maps with 2*n+1 edges and a fixed outer face of 2*k edges which are invariant under a rotation of a 1/2 turn.A091665
Triangle read by rows: T(n,k) is the number of nonseparable planar maps with 2*n+1 edges and a fixed outer face of 2*k edges which are invariant under a rotation of a 1/2 turn.
- Difference between prime(n)^2 and the next prime.A091666
Difference between prime(n)^2 and the next prime.
- Decimal expansion of ((-1-sqrt(5))/2 + sqrt((5+sqrt(5))/2))*e^((2*Pi)/5).A091667
Decimal expansion of ((-1-sqrt(5))/2 + sqrt((5+sqrt(5))/2))*e^((2*Pi)/5).
- Decimal expansion of exp(2*Pi/v) * (v/(1+(5^(3/4)/((1+v)/2)^(5/2)-1)^(1/5))-(1+v)/2), where v = sqrt(5).A091668
Decimal expansion of exp(2*Pi/v) * (v/(1+(5^(3/4)/((1+v)/2)^(5/2)-1)^(1/5))-(1+v)/2), where v = sqrt(5).
- a(n) = (2^(n-1)/n!) * Product_{k=1..n-1} (2^k-1).A091669
a(n) = (2^(n-1)/n!) * Product_{k=1..n-1} (2^k-1).
- Decimal expansion of Gamma(1/4)^4/(4*Pi^3).A091670
Decimal expansion of Gamma(1/4)^4/(4*Pi^3).
- Decimal expansion of (3*Gamma(1/3)^6)/(16*2^(2/3)*Pi^4).A091671
Decimal expansion of (3*Gamma(1/3)^6)/(16*2^(2/3)*Pi^4).
- Decimal expansion of (4*(18+12*sqrt(2)-10*sqrt(3)-7*sqrt(6)))*EllipticK((2-sqrt(3))*(-sqrt(2)+sqrt(3)))^2/Pi^2.A091672
Decimal expansion of (4*(18+12*sqrt(2)-10*sqrt(3)-7*sqrt(6)))*EllipticK((2-sqrt(3))*(-sqrt(2)+sqrt(3)))^2/Pi^2.
- Numerator Q of probability P = Q(n)/365^(n-1) that exactly two out of n people share the same birthday.A091673
Numerator Q of probability P = Q(n)/365^(n-1) that exactly two out of n people share the same birthday.
- Numerator Q of probability P = Q(n)/365^(n-1) that two or more out of n people share the same birthday.A091674
Numerator Q of probability P = Q(n)/365^(n-1) that two or more out of n people share the same birthday.
- Positive integers n such that the trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not join the trajectory of any m < n.A091675
Positive integers n such that the trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not join the trajectory of any m < n.
- a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.A091676
a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.
- a(n) = smallest non-palindromic k such that the base-4 Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A091675(n).A091677
a(n) = smallest non-palindromic k such that the base-4 Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A091675(n).
- In base 4, numbers n of the form k + reverse(k) for at least one k.A091678
In base 4, numbers n of the form k + reverse(k) for at least one k.
- In base 4, numbers n not of the form k + reverse(k) for any k.A091679
In base 4, numbers n not of the form k + reverse(k) for any k.
- Smallest number whose base-4 Reverse and Add! trajectory (presumably) contains exactly n base-4 palindromes, or -1 if there is no such number.A091680
Smallest number whose base-4 Reverse and Add! trajectory (presumably) contains exactly n base-4 palindromes, or -1 if there is no such number.
- Decimal expansion of BesselJ(0,2).A091681
Decimal expansion of BesselJ(0,2).
- Decimal expansion of 2*(18 + sqrt(3)*Pi)/27.A091682
Decimal expansion of 2*(18 + sqrt(3)*Pi)/27.
- Decimal expansion of HypergeometricPFQ[{1,1,1},{1/3,2/3},1/27].A091683
Decimal expansion of HypergeometricPFQ[{1,1,1},{1/3,2/3},1/27].
- a(n) = 0 if n is divisible by 3, otherwise a(n) = n.A091684
a(n) = 0 if n is divisible by 3, otherwise a(n) = n.
- Sieve out 6n+1 and 6n-1.A091685
Sieve out 6n+1 and 6n-1.
- a(n) = 0^n + ((n-9)/9)*(1-10^n).A091686
a(n) = 0^n + ((n-9)/9)*(1-10^n).
- Number of lattice congruences of the weak order on the Coxeter group S_n (the symmetric group).A091687
Number of lattice congruences of the weak order on the Coxeter group S_n (the symmetric group).
- Number of lattice congruences of the weak order on the Coxeter group B_n.A091688
Number of lattice congruences of the weak order on the Coxeter group B_n.
- Smallest partition number with n-th prime as factor.A091689
Smallest partition number with n-th prime as factor.
- Smallest integer m such that the n-th prime A000040(n) divides partition number A000041(m).A091690
Smallest integer m such that the n-th prime A000040(n) divides partition number A000041(m).
- a(n) = (10^(n-1)-1) * (n-10) / 9.A091691
a(n) = (10^(n-1)-1) * (n-10) / 9.
- (10^n-1) * (n+9) / 9.A091692
(10^n-1) * (n+9) / 9.
- a(n) = (n*10^n - n + 9)/9.A091693
a(n) = (n*10^n - n + 9)/9.
- Trott's second constant: decimal expansion is same as terms in its non-simple continued fraction read serially.A091694
Trott's second constant: decimal expansion is same as terms in its non-simple continued fraction read serially.
- Expansion of e.g.f. exp(x/(1-x)^3).A091695
Expansion of e.g.f. exp(x/(1-x)^3).
- Number of classes of compositions of n equivalent under reflection or cycling.A091696
Number of classes of compositions of n equivalent under reflection or cycling.
- Values of m corresponding to members of A088966.A091697
Values of m corresponding to members of A088966.
- Matrix inverse of triangle A063967.A091698
Matrix inverse of triangle A063967.
- Row sums of triangle A091698.A091699
Row sums of triangle A091698.
- Matrix square of triangle A063967.A091700
Matrix square of triangle A063967.
- Row sums of triangle A091700.A091701
Row sums of triangle A091700.
- Column 0 of triangle A091700.A091702
Column 0 of triangle A091700.
- Count, setting 5n to zero.A091703
Count, setting 5n to zero.
- Number of Barker codes (or Barker sequences) of length n up to reversals and negations.A091704
Number of Barker codes (or Barker sequences) of length n up to reversals and negations.
- Number of primes less than 10^n having at least one digit 4.A091705
Number of primes less than 10^n having at least one digit 4.
- Number of primes less than 10^n having at least one digit 5.A091706
Number of primes less than 10^n having at least one digit 5.
- Number of primes less than 10^n having at least one digit 6.A091707
Number of primes less than 10^n having at least one digit 6.
- Number of primes less than 10^n having at least one digit 7.A091708
Number of primes less than 10^n having at least one digit 7.
- Number of primes less than 10^n having at least one digit 8.A091709
Number of primes less than 10^n having at least one digit 8.
- Number of primes less than 10^n having at least one digit 9.A091710
Number of primes less than 10^n having at least one digit 9.