A061549 -id:A061549 - cp's OEIS frontend

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

N. J. A. Sloane

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

			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, ...

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.

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.

Cf. A000142, A000984, A001147, A001316, A001800, A001801, A001803.
Cf. A005187, A007814, A008316, A046161, A056040, A086117, A094638.
Cf. A101926, A123854, A273194, A344402.
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).

A001790:= func< n | Numerator((n+1)*Catalan(n)/4^n) >;
[A001790(n): n in [0..40]]; // G. C. Greubel, Sep 23 2024

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

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 *)

{a(n) = if( n<0, 0, polcoeff( pollegendre(n), n) * 2^valuation((n\2*2)!, 2))};

a(n)=binomial(2*n,n)>>hammingweight(n); \\ Gleb Koloskov, Sep 26 2021

# 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

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

A120738 a(n) = 4*n - A000120(n).

Original entry on oeis.org

0, 3, 7, 10, 15, 18, 22, 25, 31, 34, 38, 41, 46, 49, 53, 56, 63, 66, 70, 73, 78, 81, 85, 88, 94, 97, 101, 104, 109, 112, 116, 119, 127, 130, 134, 137, 142, 145, 149, 152, 158, 161, 165, 168, 173, 176, 180, 183, 190, 193, 197, 200, 205, 208, 212, 215, 221, 224, 228

Offset: 0

Paul Barry, Jun 29 2006

Partial sums of A090739.
a(n) is also the increasing sequence of exponents of x in Product_{k > 1} (1 + x^(2^k - 1)). - Paul Pearson (ppearson(AT)rochester.edu), Aug 06 2008
Related to partial sums of the Ruler sequence A001511 by a(n) = A005187(2n), therefore {a(n)+1} are the indices of 1's in A252488. - M. F. Hasler, Jan 22 2015

Michel Marcus, Table of n, a(n) for n = 0..10000
Keith Johnson, and Kira Scheibelhut, Rational Polynomials That Take Integer Values at the Fibonacci Numbers, American Mathematical Monthly 123.4 (2016): 338-346. See p. 340.

Cf. A000120, A000225, A001316, A001511, A005187, A011371, A030308, A061549, A067624, A086343, A090739, A117972, A252488.

A120738:= func< n | 4*n-(&+Intseq(n, 2)) >;
[A120738(n): n in [0..100]]; // G. C. Greubel, Oct 20 2024

a:=n->simplify(log[2](16^n/(add(modp(binomial(n,k),2),k=0..n))));
a:=n->simplify(log[2](16^n/(2^(n-(padic[ordp](n!,2)))))); # Note: n-(padic[ordp](n!,2)) is the number of 1's in the binary expansion of n. - Paul Pearson (ppearson(AT)rochester.edu), Aug 06 2008

Table[4 n - DigitCount[n, 2, 1], {n, 0, 58}] (* Michael De Vlieger, Nov 06 2016 *)

{a(n) = if( n < 0, 0, 4*n - subst( Pol( binary( n ) ), x, 1) ) } /* Michael Somos, Aug 28 2007 */

a(n) = 4*n - hammingweight(n); \\ Michel Marcus, Nov 06 2016

# Python 3.10
def A120738(n): return (n<<2)-n.bit_count() # Chai Wah Wu, Jul 12 2022

A120738 = lambda n: 4*n - sum(n.digits(2))
print([A120738(n) for n in (0..58)]) # Peter Luschny, Nov 06 2016

a(n) = log_2(16^n/A001316(n)). [This was the original definition.]
a(n) = 2n + A005187(n).
a(n) = 3n + A011371(n).
a(n) = 4n - log_2(A001316(n)).
a(n) = log_2(A061549(n)).
2^a(n) = 16^n/A001316(n) = A061549(n).
a(n) = A086343(n) + A001511(n) for n>0. - Alford Arnold, Mar 23 2009
2^a(n) = abs(A067624(n)/A117972(n)). - Johannes W. Meijer, Jul 06 2009
a(n) = Sum_{k>=0} (A030308(n,k)*A000225(k+2)). - Philippe Deléham, Oct 16 2011
a(n) = A005187(2n). - M. F. Hasler, Jan 22 2015

Definition simplified by M. F. Hasler, Dec 29 2012

A007946 a(n) = 6(2n+1)! / ((n!)^2*(n+3)).

Original entry on oeis.org

2, 9, 36, 140, 540, 2079, 8008, 30888, 119340, 461890, 1790712, 6953544, 27041560, 105306075, 410605200, 1602881040, 6263890380, 24502865310, 95937144600, 375945078600, 1474358525640, 5786272150230, 22724268808176, 89301056353200, 351140573438200, 1381487341784004

Offset: 0

David W. Wilson and Dean Hickerson, Apr 21 1997

If Y is a fixed 2-subset of a 2n-set X then a(n-2) is the number of (n-1)-subsets of X intersecting Y. - Milan Janjic, Oct 21 2007

G. C. Greubel, Table of n, a(n) for n = 0..1000
Milan Janjic, Two Enumerative Functions.

Cf. A000120, A001622, A001791, A002054, A061549, A242986.

[Binomial(2*n+2, n) + Binomial(2*n+3, n) : n in [0..30]]; // Wesley Ivan Hurt, Aug 23 2014

A007946:=n->binomial(2*n+2,n)+binomial(2*n+3,n): seq(A007946(n), n=0..30); # Wesley Ivan Hurt, Aug 23 2014

Table[Binomial[2 n + 2, n] + Binomial[2 n + 3, n], {n, 0, 30}] (* Wesley Ivan Hurt, Aug 23 2014 *)
Table[6*(2*n + 1)!/((n!)^2*(n + 3)), {n,0,50}] (* G. C. Greubel, Jan 23 2017 *)

for(n=0,50, print1(6*(2*n + 1)!/((n!)^2*(n + 3)), ", ")) \\ G. C. Greubel, Jan 23 2017

a(n) = C(2n+2, n) + C(2n+3, n). - Emeric Deutsch, May 16 2003
From Karol A. Penson, Aug 23 2014: (Start)
O.g.f.: ((-2+1/z^2-2/z)/sqrt(1-4*z)-1/z^2)/(2*z).
Representation as the n-th moment of a signed function: w(x) = sqrt(x/(4-x))*(x^2-2*x-2)/(2*Pi) on the segment x = (0,4): a(n) = Integral_{x=0..4} x^n*w(x) dx. For x->0, w(x)->0, and for x->4, w(x)->infinity.
a(n) ~ (3/65536)*(4^n)*(-55332459+18443992*n - 6147840*n^2 + 2050048*n^3 - 688128*n^4 + 262144*n^5)/(n^(11/2)*sqrt(Pi)), for n->infinity.
(End)
a(n) = A001791(n+1) + A002054(n+1). - Wesley Ivan Hurt, Aug 23 2014
From Peter Luschny, Aug 25 2014: (Start)
a(n) = ((6*(2*n+1))/(n+3))* binomial(2*n,n).
a(n) has the asymptotic series 2^(2*n+3)*(1+(n+3)/((2*n+3))) *Sum_{k>=0}((num(k)/den(k))*(-n)^(-k))/sqrt(n*Pi). Here den(n) = 2^(4*n-A000120(n)) = A061549(n) and num(n) = 1, 25, 1297, 32755, 3249099, 79652055, 3876842453, 93900904955, 18138634602803, 437081823058595, 21036073578365391,... For example a(100) = 0.10602088220899083... *10^61 with the given values of num.
a(x) ~ exp(x*log(4)-(log(Pi)+cos(2*Pi*x)*(log(x) + 1/(4*x)))/2 + log((12*x+6)/ (3+x))). For example, this formula gives a(100) = 0.10602088... *10^61.
a(n) = A242986(2*n). (End)
a(n) = 12*4^n*Gamma(3/2+n)/(sqrt(Pi)*(3+n)*Gamma(1+n)). - Peter Luschny, Dec 14 2015
a(n) = 2*Sum_{i=0..n} (1/(i+1)*binomial(2*i+3,i+3)*binomial(2*(n-i),n-i)). - Vladimir Kruchinin, Apr 20 2016
E.g.f.: 2*(x*(-1 + 3*x)*BesselI(0,2*x) + (1 - 2*x + 3*x^2) * BesselI(1,2*x))*exp(2*x)/x^2. - Ilya Gutkovskiy, Apr 20 2016
D-finite with recurrence n*(n+3)*a(n) -2*(n+2)*(2*n+1)*a(n-1) = 0. - R. J. Mathar, Mar 30 2022
From Amiram Eldar, Feb 16 2023: (Start)
Sum_{n>=0} 1/a(n) = 8*Pi/(27*sqrt(3)) + 1/9.
Sum_{n>=0} (-1)^n/a(n) = 8*log(phi)/(5*sqrt(5)) + 1/15, where phi is the golden ratio (A001622). (End)

A162448 Numerators of the column sums of the LG1 matrix.

Original entry on oeis.org

-11, 863, -215641, 41208059, -9038561117, 28141689013943, -2360298440602051, 3420015713873670001, -147239749512798268300237, 176556159649301309969405807, -178564975300377173768513546347

Offset: 2

Johannes W. Meijer, Jul 06 2009

The LG1 matrix coefficients are defined by LG1[2m,1] = 2*lambda(2m+1) for m = 1, 2, .. , and the recurrence relation LG1[2*m,n] = LG1[2*m-2,n-1]/((2*n-3)*(2*n-1)) - (2*n-3)*LG1[2*m,n-1]/(2*n-1) with m = .. , -2, -1, 0, 1, 2, .. and n = 1, 2, 3, .. , under the condition that n <= m. As usual lambda(m) = (1-2^(-m))*zeta(m) with zeta(m) the Riemann zeta function. For the LG2 matrix, the even counterpart of the LG1 matrix, see A008956.
These two formulas enable us to determine the values of the LG1[2*m,n] coefficients, with m all integers and n all positive integers, but not for all. If we choose, somewhat but not entirely arbitrarily, LG1[0,1] = gamma, with gamma the Euler-Mascheroni constant, we can determine them all.
The coefficients in the columns of the LG1 matrix, for m >= 1 and n >= 2, can be generated with GFL(z;n) = (hg(n)*CFN2(z;n)*GFL(z;n=1) + LAMBDA(z;n))/pg(n) with pg(n) = 6*(2*n-3)!!*(2*n-1)!!*A160476(n) and hg(n) = 6*A160476(n). For the CFN2(z;n) and the LAMBDA(z;n) see A160487.
The values of the column sums cs(n) = sum(LG1[2*m,n], m = 0.. infinity), for n >= 2, can be determined with the first Maple program. In this program we have made use of the remarkable fact that if we take LGx[2*m,n] = 2, for m >= 0, and LGx[ -2,n] = LG1[ -2,n] and assume that the recurrence relation remains the same we find that the column sums of this new matrix converge to the same values as the original cs(n).
The LG1[2*m,n] matrix coefficients can be generated with the second Maple program.
The LG1 matrix is related to the LS1 matrix, see A160487 and the formulas below.

			The first few generating functions GFL(z;n) are:
GFL(z;2) = (6*(z^2-1)*GFL(z;1)+(1))/18
GFL(z;3) = (60*(z^4-10*z^2+9)*GFL(z;1)+(-107+10*z^2))/2700
GFL(z;4) = (1260*(z^6-35*z^4+259*z^2-225)*GFL(z;1)+(59845-7497*z^2+210*z^4))/ 1984500

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 23, pp. 811-812.

See A162449 for the denominators of the column sums.
The LAMBDA(z, n) polynomials and the LS1 matrix lead to the Lambda triangle A160487.
The CFN2(z, n), the cfn2(n, k) and the LG2 matrix lead to A008956.
The pg(n) and hg(n) sequences lead to A160476.
The LG1[ -2, n] lead to A002197, A002198, A061549 and A001790.
Cf. A001620 (gamma) and A079484 ((2n-1)!!*(2n+1)!!).
Cf. A162440 (EG1 matrix), A162443 (BG1 matrix) and A162446 (ZG1 matrix)

nmax := 12; mmax := nmax: for n from 0 to nmax do cfn2(n, 0) := 1: cfn2(n, n) := (doublefactorial(2*n-1))^2 od: for n from 1 to nmax do for k from 1 to n-1 do cfn2(n, k) := (2*n-1)^2*cfn2(n-1, k-1)+cfn2(n-1, k) od: od: for n from 1 to nmax do Delta(n-1) := sum((1-2^(2*k1-1))*(-1)^(n+1)*(-bernoulli(2*k1)/(2*k1))*(-1)^(k1+n)*cfn2(n-1, n-k1), k1=1..n)/ (2*4^(n-1)*(2*n-1)!) od: for n from 1 to nmax do LG1[ -2, n] := (-1)^(n+1)*4*Delta(n-1)* 4^(2*n-2)/binomial(2*n-2, n-1) od: for n from 1 to nmax do LGx[ -2, n] := LG1[ -2, n] od: for m from 0 to mmax do LGx[2*m, 1] := 2 od: for n from 2 to nmax do for m from 0 to mmax do LGx[2*m, n] := LGx[2*m-2, n-1]/((2*n-3)*(2*n-1)) - (2*n-3)*LGx[2*m, n-1]/(2*n-1) od: od: for n from 2 to nmax do s(n) := 0; for m from 0 to mmax-1 do s(n) := s(n) + LGx[2*m, n] od: od: seq(s(n), n=2..nmax);
# End program 1
nmax1:=5; ncol:=3; Digits:=20: mmax1:=nmax1: for n from 0 to nmax1 do cfn2(n, 0):=1: cfn2(n, n) := (doublefactorial(2*n-1))^2 od: for n from 1 to nmax1 do for k from 1 to n-1 do cfn2(n, k) := (2*n-1)^2*cfn2(n-1, k-1) + cfn2(n-1, k) od: od: for m from 1 to mmax1 do LG1[ -2*m, 1] := (((2^(2*m-1)-1)*bernoulli(2*m)/m)) od: LG1[0, 1] := evalf(gamma): for m from 2 to mmax1 do LG1[2*m-2, 1] := evalf(2*(1-2^(-2*m+1))*Zeta(2*m-1)) od: for m from -mmax1+ncol-1 to mmax1-1 do LG1[2*m, ncol] := sum((-1)^(k1+1)*cfn2(ncol-1, k1-1)* LG1[2*m-(2*ncol-2*k1), 1], k1=1..ncol)/(doublefactorial(2*ncol-3)*doublefactorial(2*ncol-1)) od;
# End program 2
# Maple programs edited by Johannes W. Meijer, Sep 25 2012

a(n) = numer(cs(n)) and denom(cs(n)) = A162449(n).
with cs(n) = sum(LG1[2*m,n], m = 0 .. infinity) for n >= 2.
GFL(z;n) = sum( LG1[2*m,n]*z^(2*m-2),m=1..infinity)
GFL(z;n) = (LG1[ -2,n-1])/((2*n-3)*(2*n-1))+(z^2/((2*n-3)*(2*n-1))-(2*n-3)/(2*n-1))*GFL(z;n-1) with GFL(z;n=1) = -2*Psi(1-z)+Psi(1-(z/2))-(Pi/2)*tan(Pi*z/2)
LG1[ -2,n] = (-1)^(n+1)*4*(A061549(n-1)/A001790(n-1))*(A002197(n-1)/A002198(n-1))
LG1[2*m,n] = (4^(n-1)/((2*n-1)*binomial(2*n-2,n-1)))*LS1[2*m,n]

A067624 a(n) = 2^(2n)(2*n)!.

Original entry on oeis.org

1, 8, 384, 46080, 10321920, 3715891200, 1961990553600, 1428329123020800, 1371195958099968000, 1678343852714360832000, 2551082656125828464640000, 4714400748520531002654720000, 10409396852733332453861621760000

Offset: 0

Benoit Cloitre, Feb 02 2002

nonn

For n >= 1, a(n) equals the absolute value of the determinant of the 4n X 4n matrix with i's along the superdiagonal (where i is the imaginary unit), and 2, 3, 4, ... 4*n along the subdiagonal, and 0's everywhere else. (See Mathematica code below.) - John M. Campbell, Jun 04 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000165.

Appears in A162445, A061549 and A120738. - Johannes W. Meijer, Jul 06 2009

[2^(2*n)*Factorial(2*n): n in [0..15]]; // Vincenzo Librandi, Feb 18 2018

for n from 0 to 30 by 2 do printf(`%d,`,2^(n)*(n)!) od: # James Sellers, Feb 11 2002
A067624 := n -> 2^(2*n)*(2*n)!: seq(A067624(n), n=0..12); # Johannes W. Meijer, Jan 05 2017

Table[Abs[Det[Array[KroneckerDelta[#1 + 1, #2]*I &, {4*n, 4*n}] + Array[KroneckerDelta[#1 - 1, #2]*#1 &, {4*n, 4*n}]]], {n, 1, 20}] (* John M. Campbell, Jun 04 2011 *)
Table[2^(2 n) (2 n)!, {n, 0, 30}] (* Vincenzo Librandi, Feb 18 2018 *)

a(n) = A000165(2*n) where A000165(k) are the double factorial numbers 2^k*k!=(2k)!!. - Corrected by Johannes W. Meijer, Jul 05 2009
a(n) = (4*n)!! = 2^(2*n)*(2*n)!. - Johannes W. Meijer, Jul 06 2009
sqrt((1+cos(x))/2) = Sum_{n>=0} (-1)^n * x^(2*n) / a(n).
a(n) = (A280442(n)/A046161(n))/(A223067(n)/A223068(n)). - Johannes W. Meijer, Jan 05 2017
From Amiram Eldar, Jul 12 2020: (Start)
Sum_{n>=0} 1/a(n) = cosh(1/2).
Sum_{n>=0} (-1)^n/a(n) = cos(1/2). (End)

More terms from James Sellers, Feb 11 2002

A061548 Numerator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p = 1/4.

Original entry on oeis.org

1, 3, 35, 231, 6435, 46189, 676039, 5014575, 300540195, 2268783825, 34461632205, 263012370465, 8061900920775, 61989816618513, 956086325095055, 7391536347803839, 916312070471295267, 7113260368810144185, 110628135069209194801, 861577581086657669325, 26876802183334044115405

Offset: 0

Leah Schmelzer (leah2002(AT)mit.edu), May 16 2001

			For n=1, the binomial(2*n-1/2, -1/2) yields the term 3/8. The numerator of this term is 3, which is the second term of the sequence.

Indranil Ghosh, Table of n, a(n) for n = 0..500
Robert M. Kozelka, Grade Point Averages and the Central Limit Theorem, American Mathematical Monthly. Nov. 1979 (86:9) pp. 773-7.

Cf. A001316, A001448, A061549, A117973.

Bisection of A001790.

A061548:= func< n | Numerator(Binomial(4*n,2*n)/4^n) >;
[A061548(n): n in [0..25]]; // G. C. Greubel, Oct 19 2024

seq(numer(binomial(2*n-1/2, -1/2)), n=0..20);

Table[Numerator[(4*n) !/(2^(4*n)*(2*n) !^2) ], {n, 0, 20}] (* Indranil Ghosh, Mar 11 2017 *)
Table[Numerator[SeriesCoefficient[Series[(Sqrt[1 + Sqrt[1 - x]]/Sqrt[2 - 2* x]), {x, 0, n}], n]], {n, 0, 20}] (* Karol A. Penson, Apr 16 2018 *)

for(n=0, 20, print1(numerator((4*n)!/(2^(4*n)*(2*n)!^2)),", ")) \\ Indranil Ghosh, Mar 11 2017

import math
f = math.factorial
def A061548(n): return f(4*n) // math.gcd(f(4*n), (2**(4*n)*f(2*n)**2)) # Indranil Ghosh, Mar 11 2017

def A061548(n): return binomial(4*n,2*n)/2^sum(n.digits(2))
[A061548(n) for n in (0..20)]  # Peter Luschny, Mar 23 2014

a(n) = numerator(binomial(2*n-1/2, -1/2)).
From Johannes W. Meijer, Jul 06 2009: (Start)
a(n) = numerator((4*n)!/(2^(4*n)*(2*n)!^2)).
a(n) = 2*A001448(n)/ A117973(n). (End)
a(n) = A001448(n)/A001316(n). - Peter Luschny, Mar 23 2014
a(n) is the numerator of the coefficient of power series in x around x=0 of sqrt(1 + sqrt(1 - x))/(sqrt(2)*sqrt(1 - x)). - Karol A. Penson, Apr 16 2018

More terms from Asher Auel, May 20 2001

A206771 0 followed by the numerators of the reduced (A001803(n) + A001790(n)) / (2*A046161(n)).

Original entry on oeis.org

0, 1, 1, 9, 5, 175, 189, 1617, 429, 57915, 60775, 508079, 264537, 8788507, 9100525, 75218625, 9694845, 5109183315, 5250613995, 43106892675, 22090789875, 723694276305, 740104577355, 6049284520695, 1543768261425, 201547523019375

Offset: 0

Paul Curtz, Jan 10 2013

We write the fractions a(n)/b(n) and higher order differences as a matrix:
0,         1,      1,    9/8,    5/4,...
1,         0,    1/8,    1/8, 15/128,... = (A001790(n)/A046161(n) +Lorbeta(n)) /2
-1,      1/8,      0, -1/128, -1/128,... = (Lorbeta(n+1) +A161200(n+1)/A046161(n+1)) / 2
9/8,    -1/8, -1/128,      0, 1/1024,...
-5/4, 15/128,  1/128, 1/1024,      0,...
Here, Lorbeta(0)=1 and Lorbeta(n) = -A098597(n-1)/A046161(n) for n>0 is the inverse of the Lorentz factor.
The first line with numerators a(n) and denominators b(n) is 0, 1, 1, 9/8, 5/4, 175/128, 189/128, 1617/1024, 429/256, 57915/32768, 60775/32768,... It is an autosequence: Its inverse binomial transform is the signed sequence.
a(n+1)/(2*n-1)= 1, 3, 1, 25, 21, 147, 33, 3861, 3575, 26741,... .
a(n+1)/A146535(n) = 9, 5, 35, 27, 539, 39, 4455,... .
A001790(n)/A046161(n) yields the coefficients of the Lorentz factor (or Lorentz gamma factor). With b for beta and g for gamma:
g = (1-b^2)^-1 = 1 + (b^2)/2 + 3*(b^4)/8 + 5*(b^6)/16 + ... .
b = (1-g^-2)^-1 = 1 - (g^-2)/2 - (g^-4)/8 - (g^-6)/16  - ... .
Are the denominators of the first subdiagonal 1, 1/8, -1/128, 1/1024,...  A061549(n) ?
a(n+1)/(A000108(n)*b(n)) = 1, 1, 9/16, 1/4, 25/256, 9/256, 49/4096, 1/256, 81/65536, 25/65536, 121/1048576,... = A191871(n+1)/ A084623(n+1)^2 ?

			From the first formula: a(1)=1*1, a(2)=1*1, a(3)=3*3, a(4)=1*5, a(5)=5*35, a(6)=3*63.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
OEIS Wiki, Autosequence
Wikipedia, Lorentz Factor.

Cf. A187791, A000108.

/* By definition: */ m:=25; R:=PowerSeriesRing(Rationals(), m); p:=Coefficients(R!(1/(1-x)^(1/2))); q:=Coefficients(R!((1-x)^(-3/2))); A001790:=[Numerator(p[i]): i in [1..m]]; A001803:=[Numerator(q[i]): i in [1..m]]; A046161:=[Denominator(Binomial(2*n,n)/4^n): n in [0..m-1]]; [0] cat [Numerator((A001803[n]+A001790[n])/(2*A046161[n])): n in [1..m]]; // Bruno Berselli, Mar 11 2013

A206771 := proc(n)
        A001790(n)+A001803(n) ;
        %/2/A046161(n) ;
        numer(%) ;
end proc: # R. J. Mathar, Jan 18 2013

max = 25; A001803 = CoefficientList[Series[(1 - x)^(-3/2), {x, 0, max}], x] // Numerator; A001790 = CoefficientList[Series[1/Sqrt[(1 - x)], {x, 0, max}], x] // Numerator; A046161 = Table[Binomial[2n, n]/4^n, {n, 0, max}] // Denominator; a[n_] := (A001803[[n]] + A001790[[n]])/(2*A046161[[n]]) // Numerator; a[0] = 0; Table[a[n], {n, 0, max}]
(* or (from 1st formula) : *) Table[ n*Numerator[4^(1-n)*Binomial[2n-2, n-1]]/2^IntegerExponent[n, 2], {n, 0, max}]
(* or (from 2nd formula) : *) Table[ Numerator[ CatalanNumber[n-1]/2^(2n-1)]*Numerator[n^2/2^n], {n, 0, max}] (* Jean-François Alcover, Jan 31 2013 *)

a(n) = A000265(n) * A001790(n-1).
a(n) = A098597(n-1) * A191871(n). See also A181318
a(n) = numerator of n*binomial(2n-2,n-1)/4^(n-1). - Nathaniel Johnston, Dec 16 2022

a(11)-a(25) from Jean-François Alcover, Jan 13 2013

A093581 Numerators of odd moments in the distribution of chord lengths for picked at random on the circumference of a unit circle.

Original entry on oeis.org

4, 32, 512, 4096, 131072, 1048576, 16777216, 134217728, 8589934592, 68719476736, 1099511627776, 8796093022208, 281474976710656, 2251799813685248, 36028797018963968, 288230376151711744

Offset: 1

Eric W. Weisstein, Apr 01 2004

Presumably this is the same as A102557? - Andrew S. Plewe, Apr 18 2007

A102557(n) equals a(n) for n <= 55000. - G. C. Greubel, Oct 20 2024

			1, 4/Pi, 2, 32/(3*Pi), 6, 512/(15*Pi), 20, 4096/(35*Pi), ...

G. C. Greubel, Table of n, a(n) for n = 1..828
Eric Weisstein's World of Mathematics, Circle Line Picking

Cf. A000984, A001803, A061549, A102557.

Denominators are A001803*Pi.

A093581:= func< n | Power(2, 4*n-2-(&+Intseq(2*(n-1), 2))) >;
[A093581(n): n in [1..30]]; // G. C. Greubel, Oct 20 2024

Table[Power[2, 4*n-2 - DigitCount[n-1,2,1]], {n, 30}] (* G. C. Greubel, Oct 20 2024 *)

def A093581(n): return pow(2, 4*n-2 - sum((2*n-2).digits(2)))
[A093581(n) for n in range(1,31)] # G. C. Greubel, Oct 20 2024

a(n) = 4*A061549(n-1).

A143503 Numerators in the asymptotic expansion of Gamma(x+1/2)/Gamma(x).

Original entry on oeis.org

1, -1, 1, 5, -21, -399, 869, 39325, -334477, -28717403, 59697183, 8400372435, -34429291905, -7199255611995, 14631594576045, 4251206967062925, -68787420596367165, -26475975382085110035, 53392138323683746235, 26275374869163335461975, -105772979046693606062363

Offset: 1

Eric W. Weisstein, Aug 20 2008

			1/sqrt(x^(-1)) - sqrt(x^(-1))/8 + (x^(-1))^(3/2)/128 + (5*(x^(-1))^(5/2))/1024 - (21*(x^(-1))^(7/2))/32768 + ...

F. J. Dyson, N. E. Frankel and M. L. Glasser, Lehmer's Interesting Series, arXiv:1009.4274 [math-ph], 2010-2011. [Except for the signs, see the unnumbered table on p. 7.]
F. J. Dyson, N. E. Frankel and M. L. Glasser, Lehmer's interesting series, Amer. Math. Monthly, 120 (2013), 116-130. [Except for the signs, see Table 4.]
D. H. Lehmer, Interesting series involving the central binomial coefficient, Amer. Math. Monthly, 92(7) (1985), 449-457.
Eric Weisstein's World of Mathematics, Gamma Function.

Cf. A061549, A088802 (denominators), A222411, A222412.

H := proc(n) local S, i; S := (x/(exp(x)-1))^(3/2)*exp(x/2);
-pochhammer(1/2,n-1)*coeff(series(S,x,n+2),x,n)*2^(4*n-1-add(i,i= convert(n,base,2))) end:
A143503 := n -> (-1)^irem(n-1,6)*H(n-1);
seq(A143503(n), n=1..16); # Peter Luschny, Apr 05 2014

Numerator[CoefficientList[Series[Gamma[x + 1/2]/Gamma[x]/Sqrt[x], {x, Infinity, 20}], 1/x]] (* Vaclav Kotesovec, Oct 09 2023 *)

More terms from Vaclav Kotesovec, Oct 09 2023

A187791 Repeat n+1 times 2^A005187(n).

Original entry on oeis.org

1, 2, 2, 8, 8, 8, 16, 16, 16, 16, 128, 128, 128, 128, 128, 256, 256, 256, 256, 256, 256, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 2048, 2048, 2048, 2048, 2048, 2048, 2048, 2048, 32768, 32768, 32768, 32768, 32768, 32768, 32768, 32768, 32768, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 65536

Offset: 0

Paul Curtz, Jan 06 2013

a(n) is the denominators of the antidiagonals of the Lorentz factor, which can be written A001790(n)/A046161(n), and its differences.
1,           1/2,     3/8,      5/16,    35/128,     63/256,...  the Lorentz gamma factor,
-1/2,       -1/8,   -1/16,    -5/128,    -7/256,   -21/1024, ...  -A098597(n)/A046161(n+1),from the Lorentz (beta) factor,
3/8,        1/16,   3/128,     3/256,    7/1024,     9/2048,...  A161200(n+2)/A046161(n+2),
-5/16,    -5/128,  -3/256,   -5/1024,   -5/2048,  -45/32768,...  A161202(n+3)/A046161(n+4),
35/128,    7/256,  7/1024,    5/2048,  35/32768,   35/65536, ...
-63/256, -21/1024, -9/2048, -45/32768, -35/65536, -63/262144, ...  .
Like 1/n and A164555(n)/A027642(n), the Lorentz factor is an autosequence of the second kind. The first column is the signed sequence.
The main diagonal is (-1)^n *A001790(n)/A061549(n).
The Lorentz factor is the differences of (0, followed by A001803(n)) / (1, followed by A046161(n)).
PiSK(n-2)=(0, 0, followed by A001803(n)) / (1, 1, followed by A046161(n)) is also an autosequence of second kind.
Remember that an autosequence of the second kind is a sequence whose inverse binomial transform is the sequence signed, with its main diagonal being the double of its first upper diagonal. - Paul Curtz, Oct 13 2013

			1,
2,   2,
8,   8,  8,
16, 16, 16, 16.

OEIS Wiki, Autosequence
Wikipedia, Lorentz Factor.

Cf. A003506.

Flatten[Table[Denominator[Binomial[2n, n]/4^n], {n, 0, 19}, {n + 1}]] (* Alonso del Arte, Jan 07 2013 *)
(* Checking with the antidiagonals *) diff = Table[ Differences[ CoefficientList[ Series[1/Sqrt[1 - x], {x, 0, 9}], x], n], {n, 0, 9}]; Table[ diff[[n-k+1,k]] // Denominator,{n,0,10},{k,1,n}] // Flatten (* Jean-François Alcover, Jan 07 2013 *)
Flatten[Table[2^IntegerExponent[(2*n)!, 2], {n, 0, 19}, {n + 1}]]; (* Jean-François Alcover, Mar 27 2013, after A005187 *)

Repeat A046161(n) n+1 times. Triangle.

New definition by M. F. Hasler

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

A120738 a(n) = 4*n - A000120(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

Extensions

A007946 a(n) = 6*(2*n+1)! / ((n!)^2*(n+3)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A162448 Numerators of the column sums of the LG1 matrix.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

A067624 a(n) = 2^(2*n)*(2*n)!.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A061548 Numerator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p = 1/4.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

A007946 a(n) = 6(2n+1)! / ((n!)^2*(n+3)).

A067624 a(n) = 2^(2n)(2*n)!.