cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A001790 Numerators in expansion of 1/sqrt(1-x).

Original entry on oeis.org

1, 1, 3, 5, 35, 63, 231, 429, 6435, 12155, 46189, 88179, 676039, 1300075, 5014575, 9694845, 300540195, 583401555, 2268783825, 4418157975, 34461632205, 67282234305, 263012370465, 514589420475, 8061900920775, 15801325804719
Offset: 0

Views

Author

Keywords

Comments

Also numerator of e(n-1,n-1) (see Maple line).
Leading coefficient of normalized Legendre polynomial.
Common denominator of expansions of powers of x in terms of Legendre polynomials P_n(x).
Also the numerator of binomial(2*n,n)/2^n. - T. D. Noe, Nov 29 2005
This sequence gives the numerators of the Maclaurin series of the Lorentz factor (see Wikipedia link) of 1/sqrt(1-b^2) = dt/dtau where b=u/c is the velocity in terms of the speed of light c, u is the velocity as observed in the reference frame where time t is measured and tau is the proper time. - Stephen Crowley, Apr 03 2007
Truncations of rational expressions like those given by the numerator operator are artifacts in integer formulas and have many disadvantages. A pure integer formula follows. Let n$ denote the swinging factorial and sigma(n) = number of '1's in the base-2 representation of floor(n/2). Then a(n) = (2*n)$ / sigma(2*n) = A056040(2*n) / A060632(2*n+1). Simply said: this sequence is the odd part of the swinging factorial at even indices. - Peter Luschny, Aug 01 2009
It appears that a(n) = A060818(n)*A001147(n)/A000142(n). - James R. Buddenhagen, Jan 20 2010
The convolution of sequence binomial(2*n,n)/4^n with itself is the constant sequence with all terms = 1.
a(n) equals the denominator of Hypergeometric2F1[1/2, n, 1 + n, -1] (see Mathematica code below). - John M. Campbell, Jul 04 2011
a(n) = numerator of (1/Pi)*Integral_{x=-oo..+oo} 1/(x^2-2*x+2)^n dx. - Leonid Bedratyuk, Nov 17 2012
a(n) = numerator of the mean value of cos(x)^(2*n) from x = 0 to 2*Pi. - Jean-François Alcover, Mar 21 2013
Constant terms for normalized Legendre polynomials. - Tom Copeland, Feb 04 2016
From Ralf Steiner, Apr 07 2017: (Start)
By analytic continuation to the entire complex plane there exist regularized values for divergent sums:
a(n)/A060818(n) = (-2)^n*sqrt(Pi)/(Gamma(1/2 - n)*Gamma(1 + n)).
Sum_{k>=0} a(k)/A060818(k) = -i.
Sum_{k>=0} (-1)^k*a(k)/A060818(k) = 1/sqrt(3).
Sum_{k>=0} (-1)^(k+1)*a(k)/A060818(k) = -1/sqrt(3).
a(n)/A046161(n) = (-1)^n*sqrt(Pi)/(Gamma(1/2 - n)*Gamma(1 + n)).
Sum_{k>=0} (-1)^k*a(k)/A046161(k) = 1/sqrt(2).
Sum_{k>=0} (-1)^(k+1)*a(k)/A046161(k) = -1/sqrt(2). (End)
a(n) = numerator of (1/Pi)*Integral_{x=-oo..+oo} 1/(x^2+1)^n dx. (n=1 is the Cauchy distribution.) - Harry Garst, May 26 2017
Let R(n, d) = (Product_{j prime to d} Pochhammer(j / d, n)) / n!. Then the numerators of R(n, 2) give this sequence and the denominators are A046161. For d = 3 see A273194/A344402. - Peter Luschny, May 20 2021
Using WolframAlpha, it appears a(n) gives the numerator in the residues of f(z) = 2z choose z at odd negative half integers. E.g., the residues of f(z) at z = -1/2, -3/2, -5/2 are 1/(2*Pi), 1/(16*Pi), and 3/(256*Pi) respectively. - Nicholas Juricic, Mar 31 2022
a(n) is the numerator of (1/Pi) * Integral_{x=-oo..+oo} sech(x)^(2*n+1) dx. The corresponding denominator is A046161. - Mohammed Yaseen, Jul 29 2023
a(n) is the numerator of (1/Pi) * Integral_{x=0..Pi/2} sin(x)^(2*n) dx. The corresponding denominator is A101926(n). - Mohammed Yaseen, Sep 19 2023

Examples

			1, 1, 3/2, 5/2, 35/8, 63/8, 231/16, 429/16, 6435/128, 12155/128, 46189/256, ...
binomial(2*n,n)/4^n => 1, 1/2, 3/8, 5/16, 35/128, 63/256, 231/1024, 429/2048, 6435/32768, ...
		

References

  • P. J. Davis, Interpolation and Approximation, Dover Publications, 1975, p. 372.
  • W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 2nd ed. New York: Wiley, 1968; Chap. III, Eq. 4.1.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 6, equation 6:14:6 at page 51.
  • J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939, p. 102.

Crossrefs

Cf. A060818 (denominator of binomial(2*n,n)/2^n), A061549 (denominators).
Cf. A123854 (denominators).
Cf. A161198 (triangle of coefficients for (1-x)^((-1-2*n)/2)).
Cf. A163590 (odd part of the swinging factorial).
Cf. A001405.
First column and diagonal 1 of triangle A100258.
Bisection of A036069.
Bisections give A061548 and A063079.
Inverse Moebius transform of A180403/A046161.
Numerators of [x^n]( (1-x)^(p/2) ): A161202 (p=5), A161200 (p=3), A002596 (p=1), this sequence (p=-1), A001803 (p=-3), A161199 (p=-5), A161201 (p=-7).

Programs

  • Magma
    A001790:= func< n | Numerator((n+1)*Catalan(n)/4^n) >;
    [A001790(n): n in [0..40]]; // G. C. Greubel, Sep 23 2024
  • Maple
    e := proc(l,m) local k; add(2^(k-2*m)*binomial(2*m-2*k,m-k)*binomial(m+k,m)*binomial(k,l),k=l..m); end;
    # From Peter Luschny, Aug 01 2009: (Start)
    swing := proc(n) option remember; if n = 0 then 1 elif irem(n, 2) = 1 then swing(n-1)*n else 4*swing(n-1)/n fi end:
    sigma := n -> 2^(add(i,i=convert(iquo(n,2),base,2))):
    a := n -> swing(2*n)/sigma(2*n); # (End)
    A001790 := proc(n) binomial(2*n, n)/4^n ; numer(%) ; end proc : # R. J. Mathar, Jan 18 2013
  • Mathematica
    Numerator[ CoefficientList[ Series[1/Sqrt[(1 - x)], {x, 0, 25}], x]]
    Table[Denominator[Hypergeometric2F1[1/2, n, 1 + n, -1]], {n, 0, 34}]   (* John M. Campbell, Jul 04 2011 *)
    Numerator[Table[(-2)^n*Sqrt[Pi]/(Gamma[1/2 - n]*Gamma[1 + n]),{n,0,20}]] (* Ralf Steiner, Apr 07 2017 *)
    Numerator[Table[Binomial[2n,n]/2^n, {n, 0, 25}]] (* Vaclav Kotesovec, Apr 07 2017 *)
    Table[Numerator@LegendreP[2 n, 0]*(-1)^n, {n, 0, 25}] (* Andres Cicuttin, Jan 22 2018 *)
    A = {1}; Do[A = Append[A, 2^IntegerExponent[n, 2]*(2*n - 1)*A[[n]]/n], {n, 1, 25}]; Print[A] (* John Lawrence, Jul 17 2020 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( pollegendre(n), n) * 2^valuation((n\2*2)!, 2))};
    
  • PARI
    a(n)=binomial(2*n,n)>>hammingweight(n); \\ Gleb Koloskov, Sep 26 2021
    
  • Sage
    # uses[A000120]
    @CachedFunction
    def swing(n):
        if n == 0: return 1
        return swing(n-1)*n if is_odd(n) else 4*swing(n-1)/n
    A001790 = lambda n: swing(2*n)/2^A000120(2*n)
    [A001790(n) for n in (0..25)]  # Peter Luschny, Nov 19 2012
    

Formula

a(n) = numerator( binomial(2*n,n)/4^n ) (cf. A046161).
a(n) = A000984(n)/A001316(n) where A001316(n) is the highest power of 2 dividing C(2*n, n) = A000984(n). - Benoit Cloitre, Jan 27 2002
a(n) = denominator of (2^n/binomial(2*n,n)). - Artur Jasinski, Nov 26 2011
a(n) = numerator(L(n)), with rational L(n):=binomial(2*n,n)/2^n. L(n) is the leading coefficient of the Legendre polynomial P_n(x).
L(n) = (2*n-1)!!/n! with the double factorials (2*n-1)!! = A001147(n), n >= 0.
Numerator in (1-2t)^(-1/2) = 1 + t + (3/2)t^2 + (5/2)t^3 + (35/8)t^4 + (63/8)t^5 + (231/16)t^6 + (429/16)t^7 + ... = 1 + t + 3*t^2/2! + 15*t^3/3! + 105*t^4/4! + 945*t^5/5! + ... = e.g.f. for double factorials A001147 (cf. A094638). - Tom Copeland, Dec 04 2013
From Ralf Steiner, Apr 08 2017: (Start)
a(n)/A061549(n) = (-1/4)^n*sqrt(Pi)/(Gamma(1/2 - n)*Gamma(1 + n)).
Sum_{k>=0} a(k)/A061549(k) = 2/sqrt(3).
Sum_{k>=0} (-1)^k*a(k)/A061549(k) = 2/sqrt(5).
Sum_{k>=0} (-1)^(k+1)*a(k)/A061549(k) = -2/sqrt(5).
a(n)/A123854(n) = (-1/2)^n*sqrt(Pi)/(gamma(1/2 - n)*gamma(1 + n)).
Sum_{k>=0} a(k)/A123854(k) = sqrt(2).
Sum_{k>=0} (-1)^k*a(k)/A123854(k) = sqrt(2/3).
Sum_{k>=0} (-1)^(k+1)*a(k)/A123854(k) = -sqrt(2/3). (End)
a(n) = 2^A007814(n)*(2*n-1)*a(n-1)/n. - John Lawrence, Jul 17 2020
Sum_{k>=0} A086117(k+3)/a(k+2) = Pi. - Antonio Graciá Llorente, Aug 31 2024
a(n) = A001803(n)/(2*n+1). - G. C. Greubel, Sep 23 2024

A004731 a(0) = 1; thereafter a(n) = denominator of (n-2)!! / (n-1)!!.

Original entry on oeis.org

1, 1, 1, 2, 3, 8, 15, 16, 35, 128, 315, 256, 693, 1024, 3003, 2048, 6435, 32768, 109395, 65536, 230945, 262144, 969969, 524288, 2028117, 4194304, 16900975, 8388608, 35102025, 33554432, 145422675, 67108864, 300540195, 2147483648, 9917826435, 4294967296, 20419054425
Offset: 0

Views

Author

Keywords

Comments

Also numerator of rational part of Haar measure on Grassmannian space G(n,1).
Also rational part of numerator of Gamma(n/2+1)/Gamma(n/2+1/2) (cf. A036039).
Let x(m) = x(m-2) + 1/x(m-1) for m >= 3, with x(1)=x(2)=1. Then the numerator of x(n+2) equals the denominator of n!!/(n+1)!! for n >= 0, where the double factorials are given by A006882. - Joseph E. Cooper III (easonrevant(AT)gmail.com), Nov 07 2010, as corrected in Cooper (2015).
Numerator of (n-1)/( (n-2)/( .../1)), with an empty fraction taken to be 1. - Flávio V. Fernandes, Jan 31 2025

Examples

			1, 1, (1/2)*Pi, 2, (3/4)*Pi, 8/3, (15/16)*Pi, 16/5, (35/32)*Pi, 128/35, (315/256)*Pi, ...
The sequence Gamma(n/2+1)/Gamma(n/2+1/2), n >= 0, begins 1/Pi^(1/2), 1/2*Pi^(1/2), 2/Pi^(1/2), 3/4*Pi^(1/2), 8/3/Pi^(1/2), 15/16*Pi^(1/2), 16/5/Pi^(1/2), ...
		

References

  • D. A. Klain and G.-C. Rota, Introduction to Geometric Probability, Cambridge, p. 67.

Crossrefs

Cf. A001803, A004730, A006882 (double factorials), A036069.

Programs

  • Haskell
    import Data.Ratio ((%), numerator)
    a004731 0 = 1
    a004731 n = a004731_list !! n
    a004731_list = map numerator ggs where
       ggs = 0 : 1 : zipWith (+) ggs (map (1 /) $ tail ggs) :: [Rational]
    -- Reinhard Zumkeller, Dec 08 2011
    
  • Maple
    if n mod 2 = 0 then k := n/2; 2*k*Pi*binomial(2*k-1,k)/4^k else k := (n-1)/2; 4^k/binomial(2*k,k); fi;
    f:=n->simplify(GAMMA(n/2+1)/GAMMA(n/2+1/2));
    #
    [1, seq(denom(doublefactorial(n-2)/doublefactorial(n-1)), n = 1..36)]; # Peter Luschny, Feb 09 2025
  • Mathematica
    Table[ Denominator[ (n-2)!! / (n-1)!! ], {n, 0, 31}] (* Jean-François Alcover, Jul 16 2012 *)
    Denominator[#[[1]]/#[[2]]&/@Partition[Range[-2,40]!!,2,1]] (* Harvey P. Dale, Nov 27 2014 *)
    Join[{1},Table[Numerator[(n/2-1/2)!/((n/2-1)!Sqrt[Pi])], {n,1,31}]] (* Peter Luschny, Feb 08 2025 *)
  • PARI
    f(n) = prod(i=0, (n-1)\2, n - 2*i); \\ A006882
    a(n) = if (n==0, 1, denominator(f(n-2)/f(n-1))); \\ Michel Marcus, Feb 08 2025
  • Python
    from sympy import gcd, factorial2
    def A004731(n):
        if n <= 1:
            return 1
        a, b = factorial2(n-2), factorial2(n-1)
        return b//gcd(a,b) # Chai Wah Wu, Apr 03 2021
    

Extensions

Name corrected by Michel Marcus, Feb 08 2025

A101926 a(n) = 2^A101925(n).

Original entry on oeis.org

2, 4, 16, 32, 256, 512, 2048, 4096, 65536, 131072, 524288, 1048576, 8388608, 16777216, 67108864, 134217728, 4294967296, 8589934592, 34359738368, 68719476736, 549755813888, 1099511627776, 4398046511104, 8796093022208
Offset: 0

Views

Author

Ralf Stephan, Dec 28 2004

Keywords

Comments

a(n) is the numerator of 2^(2*n+1)*(n!)^2/(2*n+1)/(2*n)!. The corresponding denominator is A001803. - Daniel Suteu, Feb 03 2017
a(n) is the numerator of Integral_{x=-oo..oo} sech(x)^(2*n+2) dx. The corresponding denominator is A001803(n). - Mohammed Yaseen, Jul 25 2023
a(n) is the denominator of (1/Pi) * Integral_{x=0..Pi/2} sin(x)^(2*n) dx. The corresponding numerator is A001790(n). - Mohammed Yaseen, Sep 19 2023
a(n) = numerator(Pi*binomial(n, -1/2)). - Peter Luschny, Dec 05 2024

Crossrefs

Bisection of A036069 and of A086117.

Programs

  • Maple
    denom((binomial(2n,n)*4^-n)/2); # Stephen Crowley, Mar 05 2007
  • Mathematica
    Table[Numerator[Beta[1, n + 1, 1/2]], {n, 0, 22}] (* Gerry Martens, Nov 13 2016 *)

Extensions

More terms from Joshua Zucker, May 15 2006
Showing 1-3 of 3 results.