A001790 Numerators in expansion of 1/sqrt(1-x).
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
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.
Links
- Robert G. Wilson v, Table of n, a(n) for n = 0..1666 (first 201 terms from T. D. Noe)
- Horst Alzer and Bent Fuglede, Normalized binomial mid-coefficients and power means, Journal of Number Theory, Volume 115, Issue 2, December 2005, Pages 284-294.
- C. M. Bender and K. A. Milton, Continued fraction as a discrete nonlinear transform, arXiv:hep-th/9304062, 1993 (see V_n with N=1).
- W. G. Bickley and J. C. P. Miller, Numerical differentiation near the limits of a difference table [Annotated scanned copy].
- W. G. Bickley and J. C. P. Miller, Numerical differentiation near the limits of a difference table, Phil. Mag., 33 (1942), 1-12 (plus tables).
- Isabel Cação, Helmuth R. Malonek, Maria Irene Falcão, and Graça Tomaz, Combinatorial Identities Associated with a Multidimensional Polynomial Sequence, J. Int. Seq., Vol. 21 (2018), Article 18.7.4.
- S. Łukaszyk and W. Bieniawski, Assembly Theory of Binary Messages, Mathematics, 12(10) (2024), 1600.
- Peter Luschny, Die schwingende Fakultät und Orbitalsysteme, August 2011.
- V. H. Moll, The evaluation of integrals: a personal story, Notices Amer. Math. Soc., 49 (No. 3, March 2002), 311-317.
- Tony D. Noe, On the Divisibility of Generalized Central Trinomial Coefficients, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.7.
- H. E. Salzer, Coefficients for expressing the first twenty-four powers in terms of the Legendre polynomials, Math. Comp., 3 (1948), 16-18.
- J. Ser, Les Calculs Formels des Séries de Factorielles, Gauthier-Villars, Paris, 1933 [Local copy].
- J. Ser, Les Calculs Formels des Séries de Factorielles (Annotated scans of some selected pages).
- Eric Weisstein's World of Mathematics, Binomial Series.
- Eric Weisstein's World of Mathematics, Legendre Polynomial.
- Wikipedia, Lorentz Factor.
Crossrefs
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
Comments