A060818 -id:A060818 - cp's OEIS frontend

A224270 Absolute values of the numerators of the third column of ( 0 followed by (interleave 0 , A001803(n))/A060818(n) ) and its successive differences.

1, 1, 5, 11, 95, 203, 861, 1815, 30459, 63635, 264979, 550069, 4555915, 9412543, 38816525, 79898895, 2627302995, 5392044675, 22104436695, 45256266825, 370241638305, 756514878405, 3088866211275, 6300861570705, 102746354288175, 209286947903319

Offset: 0

Paul Curtz, Apr 02 2013

The array is
  0,          0,      1,     0,   3/2,     0,  15/8, 0,...
  0,          1,     -1,   3/2,  -3/2,  15/8, -15/8,...
  1,         -2,    5/2,    -3,  27/8, -15/4,...
  -3,       9/2,  -11/2,  51/8, -57/8,...
  15/2,     -10,   95/8, -27/2,...
  -35/2,  175/8, -203/8,...
  315/8, -189/4,...
  -693/8,...
Note A001803 in the first column and a variant of A206771(n) in the second column.
Now consider a(n)/A046161(n) and its differences:
  1,            1/2,     5/8,  11/16,  95/128, 203/256, 861/1024,...
  -1/2,         1/8,    1/16,  7/128,  13/256, 49/1024,...   =b(n)/A046161(n)
  5/8,        -1/16,  -1/128, -1/256, -3/1024,...
  -11/16,     7/128,   1/256, 1/1024,...
  95/128,   -13/256, -3/1024,...
  -203/256, 49/1024,...
  861/1024,...
This an autosequence of second kind. The first column is the signed sequence.
(Its companion, the corresponding autosequence of first kind, is 0, 1, 1, 9/8, 5/4,... in A206771).
Main diagonal: 1, 1/8, -1/128,... = A002596(n)/A061549(n) ?
b(n) = a(n+1) - A171977*a(n). Also for two successive rows (with shifted A171977).

			a(n)=numerators of 0+1=1, 0+1/2=1/2, 1/4+3/8=5/8, 3/8+5/16=11/16, 15/32+35/128=95/128,... .

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

Cf. A001790, A001803, A002596, A046161, A061549, A098597, A171977, A206771.

nmax = 25; t1 = Table[ Numerator[ (2*n+1)*(Binomial[2*n, n]/4^n)] / Denominator[ Binomial[2*n, n]/4^n], {n, 0, Ceiling[nmax/2]}]; t2 = Join[{0}, Table[ If[ OddQ[n], 0, t1[[n/2]] ], {n, 1, nmax+2}] ]; t3 = Table[ Differences[t2, n], {n, 0, nmax}]; t3[[All, 3]] // Numerator // Abs (* Jean-François Alcover, Apr 02 2013 *)

Numerators of (0, 0 followed by A001803(n)/(4*A046161(n))) + A001790(n)/A046161(n).

More terms from Jean-François Alcover, Apr 02 2013

A180878 Numerator in fraction A180878/A060818.

Original entry on oeis.org

1, 0, -1, -1, -9, -5, -21, -21, -197, -117, -427, -427, -2501, -1797, -2909, -2909, -72877, -65453

Offset: 1

Mats Granvik, Sep 23 2010

sign

The generating function 1/sqrt((1/x-1)*(1/x+1)) is symmetrical around the origin and has singularities at -1 and +1.

Cf. Analogous to fraction A180403/A046161.

Lambert series: Sum_{n >= 1} A180878(n)/A060818(n)*(x^n/(1-x^n)-x^(n+1)/(1-x^(n+1)))=1/sqrt((1/x-1)*(1/x+1)).

A046161 a(n) = denominator of binomial(2n,n)/4^n.

Original entry on oeis.org

1, 2, 8, 16, 128, 256, 1024, 2048, 32768, 65536, 262144, 524288, 4194304, 8388608, 33554432, 67108864, 2147483648, 4294967296, 17179869184, 34359738368, 274877906944, 549755813888, 2199023255552, 4398046511104, 70368744177664, 140737488355328, 562949953421312

Offset: 0

Eric W. Weisstein

Also denominator of e(0,n) (see Maple line). - N. J. A. Sloane, Feb 16 2002
Denominator of coefficient of x^n in (1+x)^(k/2) or (1-x)^(k/2) for any odd integer k. - Michael Somos, Sep 15 2004
Numerator of binomial(2n,n)/4^n = A001790(n).
Denominators in expansion of sqrt(c(x)), c(x) the g.f. of A000108. - Paul Barry, Jul 12 2005
Denominator of 2^m*Gamma(m+3/4)/(Gamma(3/4)*Gamma(m+1)). - Stephen Crowley, Mar 19 2007
Denominator in expansion of Jacobi_P(n,1/2,1/2,x). - Paul Barry, Feb 13 2008
This sequence equals the denominators of the coefficients of the series expansions of (1-x)^((-1-2*n)/2) for all integer values of n; see A161198 for detailed information. - Johannes W. Meijer, Jun 08 2009
Numerators of binomial transform of 1, -1/3, 1/5, -1/7, 1/9, ... (Madhava-Gregory-Leibniz series for Pi/4): 1, 2/3, 8/15, 16/35, 128/315, 256/693, .... First differences are -1/3, -2/15, -8/105, -16/315, -128/3465, -256/9009, ... which contain the same numerators, negated. The second differences are 1/5, 2/35, 8/315, 16/1155, 128/15015, ... again with the same numerators. Second column: 2/3, -2/15, 2/35, -2/63, 2/99; see A000466(n+1) = A005563(2n+1). Third column: 8*(1/15, -1/105, 1/315, -1/693, ...), see A061550. See A173294 and A173296. - Paul Curtz, Feb 16 2010
0, 1, 5/3, 11/5, 93/35, 193/63, 793/231, ... = (0 followed by A120778(n))/A001790(n) is the binomial transform of 0, 1, -1/3, 1/5, -1/7, 1/9, ... . See A173755 and formula below. - Paul Curtz, Mar 13 2013
Numerator of power series of arcsin(x)/sqrt(1-x^2), centered at x=0. - John Molokach, Aug 02 2013
Denominators of coefficients in the Taylor series expansion of Sum_{n>=0} exp((-1)^n * Euler(2*n)*x^n/(2*n)), see A280442 for the numerators. - Johannes W. Meijer, Jan 05 2017
Denominators of Pochhammer(n+1, -1/2)/sqrt(Pi). - Adam Hugill, Sep 11 2022
a(n) is the denominator of the mean value of cos(x)^(2*n) from x = 0 to 2*Pi. - Stefano Spezia, May 16 2023
4^n/binomial(2n,n) is the expected value of the number of socks that are randomly drawn out of a drawer of n different pairs of socks, when one sock is drawn out at a time until a matching pair is found (King and King, 2005). - Amiram Eldar, Jul 02 2023
a(n) is the denominator of (1/Pi) * Integral_{x=-oo..+oo} sech(x)^(2*n+1) dx. The corresponding numerator is A001790(n). - Mohammed Yaseen, Jul 29 2023
a(n) is the numerator of Integral_{x=0..Pi/2} sin(x)^(2*n+1) dx. The corresponding denominator is A001803(n). - Mohammed Yaseen, Sep 22 2023

			sqrt(1+x) = 1 + (1/2)*x - (1/8)*x^2 + (1/16)*x^3 - (5/128)*x^4 + (7/256)*x^5 - (21/1024)*x^6 + (33/2048)*x^7 + ...
binomial(2n,n)/4^n => 1, 1/2, 3/8, 5/16, 35/128, 63/256, 231/1024, 429/2048, 6435/32768, ...
The sequence e(0,n) begins 1, 3/2, 21/8, 77/16, 1155/128, 4389/256, 33649/1024, 129789/2048, 4023459/32768, ...

W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 2nd ed. New York: Wiley, 1968; Chap. III, Eq. 4.1.
B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 513, Eq. (7.282).
Eli Maor, e: The Story of a Number. Princeton, New Jersey: Princeton University Press (1994), p. 72.
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 6, equations 6:14:5 - 6:14:9 at pages 50-51.

T. D. Noe, Table of n, a(n) for n = 0..200
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.
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.
Jeremy and Patricia King, Problem 89.G, Problem Corner, The Mathematical Gazette, Vol. 90, No. 515 (2005), p. 314; Solution, ibid., Vol. 90, No. 517 (2006), pp. 163-164.
V. H. Moll, The evaluation of integrals: a personal story, Notices Amer. Math. Soc., 49 (No. 3, March 2002), 311-317.
Eric Weisstein's World of Mathematics, Binomial Series.
Eric Weisstein's World of Mathematics, Heads-Minus-Tails Distribution.
Eric Weisstein's World of Mathematics, Legendre Polynomial.
Eric Weisstein's World of Mathematics, Random Matrix.
Eric Weisstein's World of Mathematics, Random Walk 1-Dimensional.
Index to divisibility sequences.

Cf. A001790, A001803, A002596, A005187, A067002, A072287, A142961.
Cf. A161198 triangle related to the series expansions of (1-x)^((-1-2*n)/2) for all values of n.
Cf. A000108, A000120, A000466, A001511, A005563, A048881, A060818, A061550, A120778, A173294, A173296, A173755, A280442.

[Denominator(Binomial(2*n,n)/4^n): n in [0..30]]; // Vincenzo Librandi, Jul 18 2015

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: seq(denom(e(0,n)), n = 0..24);
Z[0]:=0: for k to 30 do Z[k]:=simplify(1/(2-z*Z[k-1])) od: g:=sum((Z[j]-Z[j-1]), j=1..30): gser:=series(g, z=0, 27): seq(denom(coeff(gser, z, n)), n=-1..23); # Zerinvary Lajos, May 21 2008
A046161 := proc(n) option remember: if n = 0 then 1 else 2^A001511(n) * procname(n-1) fi: end: A001511 := proc(n): padic[ordp](2*n, 2) end: seq(A046161(n), n = 0..24); # Johannes W. Meijer, Nov 04 2012
A046161 := n -> 4^n/2^add(i,i=convert(n, base, 2)):
seq(A046161(n), n=0..24); # Peter Luschny, Apr 08 2014

a[n_, m_] := Binomial[n - m/2 + 1, n - m + 1] - Binomial[n - m/2, n - m + 1]; s[n_] := Sum[ a[n, k], {k, 0, n}]; Table [Denominator[s[n]], {n, 0, 26}] (* Michele Dondi (bik.mido(AT)tiscalinet.it), Jul 11 2002 *)
Denominator[Table[Binomial[2n,n]/4^n,{n,0,30}]] (* Harvey P. Dale, Oct 29 2012 *)
Table[Denominator@LegendreP[2n,0],{n,0,24}] (* Andres Cicuttin, Jan 22 2018 *)

a(n) := denom(binomial(-1/2,n));
makelist(a(n),n,0,24); /* Peter Luschny, Nov 21 2012 */

a(n)=if(n<0,0,denominator(binomial(2*n,n)/4^n)) /* Michael Somos, Sep 15 2004 */

a(n)=my(s=n);while(n>>=1,s+=n);2^s \\ Charles R Greathouse IV, Apr 07 2012

a(n)=denominator(I^-n*pollegendre(n,I/2)) \\ Charles R Greathouse IV, Mar 18 2017

def A046161(n): return 1<<(n<<1)-n.bit_count() # Chai Wah Wu, Nov 15 2022

def A046161(n):
    A005187 = lambda n: A005187(n//2) + n if n > 0 else 0
    return 2^A005187(n)
[A046161(n) for n in (0..24)]  # Peter Luschny, Nov 16 2012

a(n) = 2^(2*n - 1 - A048881(n-1)), if n > 0.
a(n) = 2^A005187(n).
a(n) = 4^n/2^A000120(n). - Michael Somos, Sep 15 2004
a(n) = 2^A001511(n)*a(n-1) with a(0) = 1. - Johannes W. Meijer, Nov 04 2012
a(n) = denominator(binomial(-1/2,n)). - Peter Luschny, Nov 21 2012
a(n) = (0 followed by A120778(n)) + A001790(n). - Paul Curtz, Mar 13 2013
a(n) = 2^n*A060818(n). - Johannes W. Meijer, Jan 05 2017
a(n)/A001790(n) ~ sqrt(Pi*n) (King and King, 2005). - Amiram Eldar, Jul 02 2023

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

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

A034699 Largest prime power factor of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 7, 5, 16, 17, 9, 19, 5, 7, 11, 23, 8, 25, 13, 27, 7, 29, 5, 31, 32, 11, 17, 7, 9, 37, 19, 13, 8, 41, 7, 43, 11, 9, 23, 47, 16, 49, 25, 17, 13, 53, 27, 11, 8, 19, 29, 59, 5, 61, 31, 9, 64, 13, 11, 67, 17, 23, 7, 71, 9, 73, 37, 25, 19, 11, 13, 79

Offset: 1

David W. Wilson

n divides lcm(1, 2, ..., a(n)).
a(n) = A210208(n,A073093(n)) = largest term of n-th row in A210208. - Reinhard Zumkeller, Mar 18 2012
a(n) = smallest m > 0 such that n divides A003418(m). - Thomas Ordowski, Nov 15 2013
a(n) = n when n is a prime power (A000961). - Michel Marcus, Dec 03 2013
Conjecture: For all n between two consecutive prime numbers, all a(n) are different. - I. V. Serov, Jun 19 2019
Disproved with between p=prime(574) = 4177 and prime(575) = 4201, a(4180) = a(4199) = 19. See A308752. - Michel Marcus, Jun 19 2019
Conjecture: For any N > 0, there exist numbers n and m, N < n < n+a(n) <= m, such that all n..m are composite and a(n) = a(m). - I. V. Serov, Jun 21 2019
Conjecture: For all n between two consecutive prime numbers, all (-1)^n*a(n) are different. Checked up to 5*10^7. - I. V. Serov, Jun 23 2019
Disproved: between p = prime(460269635) = 10120168277 and p = prime(460269636) = 10120168507 the numbers n = 10120168284 and m = 10120168498 form a pair such that (-1)^n*a(n) = (-1)^m*a(m) = 107. - L. Joris Perrenet, Jan 05 2020
a(n) = cardinality of smallest set on which idempotence of order n+1 (f^{n+1} = f) differs from idempotence of order e for 2 <= e <= n (see von Eitzen link for proof); derivable from A245501. - Mark Bowron, May 22 2025

Antti Karttunen, Table of n, a(n) for n = 1..65537 (first 1000 terms from T. D. Noe)
Hagen von Eitzen, Least k to distinguish f^n = f on {1,...,k} from f^e = f for every 1 < e < n is largest prime power factor of n-1?, Math Stack Exchange.

Cf. A006530, A010055, A020639, A027750, A034684, A028233, A051283, A052128, A053585, A057110, A060818, A038610, A081805, A088387, A088388, A100574, A210208, A245501, A284600, A308752.

Numbers n ordered by a(n): A305325.

a034699 = last . a210208_row
-- Reinhard Zumkeller, Mar 18 2012, Feb 14 2012

f[n_] := If[n == 1, 1, Max[ #[[1]]^#[[2]] & /@ FactorInteger@n]]; Array[f, 79] (* Robert G. Wilson v, Sep 02 2006 *)
Array[Max[Power @@@ FactorInteger@ #] &, 79] (* Michael De Vlieger, Jul 26 2018 *)

a(n) = if(1==n,n,my(f=factor(n)); vecmax(vector(#f[, 1], i, f[i, 1]^f[i, 2]))); \\ Charles R Greathouse IV, Nov 20 2012, check for a(1) added by Antti Karttunen, Aug 06 2018

A034699(n) = if(1==n,n,fordiv(n, d, if(isprimepower(n/d), return(n/d)))); \\ Antti Karttunen, Aug 06 2018

from sympy import factorint
def A034699(n): return max((p**e for p, e in factorint(n).items()), default=1) # Chai Wah Wu, Apr 17 2023

If n = p_1^e_1 *...* p_k^e_k, p_1 < ... < p_k primes, then a(n) = Max_i p_i^e_i.
a(n) = A088387(n)^A088388(n). - Antti Karttunen, Jul 22 2018
a(n) = n/A284600(n) = n - A081805(n) = A034684(n) + A100574(n). - Antti Karttunen, Aug 06 2018
a(n) = a(m) iff m = d*a(n), where d is a divisor of A038610(a(n)). - I. V. Serov, Jun 19 2019

A220466 a((2n-1)2^p) = 4^p(n-1) + 2^(p-1)(1+2^p), p >= 0 and n >= 1.

Original entry on oeis.org

1, 3, 2, 10, 3, 7, 4, 36, 5, 11, 6, 26, 7, 15, 8, 136, 9, 19, 10, 42, 11, 23, 12, 100, 13, 27, 14, 58, 15, 31, 16, 528, 17, 35, 18, 74, 19, 39, 20, 164, 21, 43, 22, 90, 23, 47, 24, 392, 25, 51, 26, 106, 27, 55, 28, 228, 29, 59, 30, 122, 31, 63, 32, 2080, 33, 67, 34, 138, 35

Offset: 1

Johannes W. Meijer, Dec 24 2012

The a(n) appeared in the analysis of A220002, a sequence related to the Catalan numbers.
The first Maple program makes use of a program by Peter Luschny for the calculation of the a(n) values. The second Maple program shows that this sequence has a beautiful internal structure, see the first formula, while the third Maple program makes optimal use of this internal structure for the fast calculation of a(n) values for large n.
The cross references lead to sequences that have the same internal structure as this sequence.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Ralf Stephan, Some divide-and-conquer sequences with simple ordinary generating functions, The OEIS, Jan 01 2004.

Cf. A000027 (the natural numbers), A000120 (1's-counting sequence), A000265 (remove 2's from n), A001316 (Gould's sequence), A001511 (the ruler function), A003484 (Hurwitz-Radon numbers), A003602 (a fractal sequence), A006519 (highest power of 2 dividing n), A007814 (binary carry sequence), A010060 (Thue-Morse sequence), A014577 (dragon curve), A014707 (dragon curve), A025480 (nim-values), A026741, A035263 (first Feigenbaum symbolic sequence), A037227, A038712, A048460, A048896, A051176, A053381 (smooth nowhere-zero vector fields), A055975 (Gray code related), A059134, A060789, A060819, A065916, A082392, A085296, A086799, A088837, A089265, A090739, A091512, A091519, A096268, A100892, A103391, A105321 (a fractal sequence), A109168 (a continued fraction), A117973, A129760, A151930, A153733, A160467, A162728, A181988, A182241, A191488 (a companion to Gould's sequence), A193365, A220466 (this sequence).

-- Following Ralf Stephan's recurrence:
import Data.List (transpose)
a220466 n = a006519_list !! (n-1)
a220466_list = 1 : concat
   (transpose [zipWith (-) (map (* 4) a220466_list) a006519_list, [2..]])
-- Reinhard Zumkeller, Aug 31 2014

# First Maple program
a := n -> 2^padic[ordp](n, 2)*(n+1)/2 : seq(a(n), n=1..69); # Peter Luschny, Dec 24 2012
# Second Maple program
nmax:=69: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 1 to ceil(nmax/(p+2)) do a((2*n-1)*2^p) := 4^p*(n-1)  + 2^(p-1)*(1+2^p) od: od: seq(a(n), n=1..nmax);
# Third Maple program
nmax:=69: for p from 0 to ceil(simplify(log[2](nmax))) do n:=2^p: n1:=1: while n <= nmax do a(n) := 4^p*(n1-1)+2^(p-1)*(1+2^p): n:=n+2^(p+1): n1:= n1+1: od: od:  seq(a(n), n=1..nmax);

A220466 = Module[{n, p}, p = IntegerExponent[#, 2]; n = (#/2^p + 1)/2; 4^p*(n - 1) + 2^(p - 1)*(1 + 2^p)] &; Array[A220466, 50] (* JungHwan Min, Aug 22 2016 *)

a(n)=if(n%2,n\2+1,4*a(n/2)-2^valuation(n/2,2)) \\ Ralf Stephan, Dec 17 2013

a((2*n-1)*2^p) = 4^p*(n-1) + 2^(p-1)*(1+2^p), p >= 0 and n >= 1. Observe that a(2^p) = A007582(p).
a(n) = ((n+1)/2)*(A060818(n)/A060818(n-1))
a(n) = (-1/64)*(q(n+1)/q(n))/(2*n+1) with q(n) = (-1)^(n+1)*2^(4*n-5)*(2*n)!*A060818(n-1) or q(n) = (1/8)*A220002(n-1)*1/(A098597(2*n-1)/A046161(2*n))*1/(A008991(n-1)/A008992(n-1))
Recurrence: a(2n) = 4a(n) - 2^A007814(n), a(2n+1) = n+1. - Ralf Stephan, Dec 17 2013

A049606 Largest odd divisor of n!.

Original entry on oeis.org

1, 1, 1, 3, 3, 15, 45, 315, 315, 2835, 14175, 155925, 467775, 6081075, 42567525, 638512875, 638512875, 10854718875, 97692469875, 1856156927625, 9280784638125, 194896477400625, 2143861251406875, 49308808782358125, 147926426347074375, 3698160658676859375

Offset: 0

N. J. A. Sloane, Feb 05 2000

Original name: Denominator of 2^n/n!.
For positive n, a(n) equals the numerator of the permanent of the n X n matrix whose (i,j)-entry is cos(i*Pi/3)*cos(j*Pi/3) (see example below). - John M. Campbell, May 28 2011
a(n) is also the number of binomial heaps with n nodes. - Zhujun Zhang, Jun 16 2019
a(n) is the number of 2-Sylow subgroups of the symmetric group S_n (see the Mathematics Stack Exchange link below). - Jianing Song, Nov 11 2022

			From _John M. Campbell_, May 28 2011: (Start)
The numerator of the permanent of the following 5 X 5 matrix is equal to a(5):
|  1/4  -1/4  -1/2  -1/4   1/4 |
| -1/4   1/4   1/2   1/4  -1/4 |
| -1/2   1/2    1    1/2  -1/2 |
| -1/4   1/4   1/2   1/4  -1/4 |
|  1/4  -1/4  -1/2  -1/4   1/4 | (End)

T. D. Noe, Table of n, a(n) for n = 0..100
Mathematics Stack Exchange, On the number of Sylow subgroups in Symmetric Group
Zhujun Zhang, A Note on Counting Binomial Heaps, ResearchGate, June 2019.

Numerators of 2^n/n! give A001316. Cf. A000680, A008977, A139541.
Factor of A160481. - Johannes W. Meijer, May 24 2009
Equals A003148 divided by A123746. - Johannes W. Meijer, Nov 23 2009
Different from A160624.
Cf. A011371.

[ Denominator(2^n/Factorial(n)): n in [0..25] ]; // Klaus Brockhaus, Mar 10 2011

f:= n-> n! * 2^(add(i,i=convert(n,base,2))-n); # Peter Luschny, May 02 2009
seq (denom (coeff (series(1/(tanh(t)-1), t, 30), t, n)), n=0..25); # Peter Luschny, Aug 04 2011
seq(numer(n!/2^n), n=0..100); # Robert Israel, Jul 23 2015

Denominator[Table[(2^n)/n!,{n,0,40}]] (* Vladimir Joseph Stephan Orlovsky, Apr 03 2011*)
Table[Last[Select[Divisors[n!],OddQ]],{n,0,30}] (* Harvey P. Dale, Jul 24 2016 *)
Table[n!/2^IntegerExponent[n!,2], {n,1,30}] (* Clark Kimberling, Oct 22 2016 *)

A049606(n)=local(f=n!);f/2^valuation(f,2); \\ Joerg Arndt, Apr 22 2011
(Python 3.10+)
from math import factorial
def A049606(n): return factorial(n)>>n-n.bit_count() # Chai Wah Wu, Jul 11 2022

a(n) = Product_{k=1..n} A000265(k).
a(n) = A000265(A000142(n)). - Reinhard Zumkeller, Apr 09 2004
a(n) = numerator(2*Sum_{i>=1} (-1)^i*(1-zeta(n+i+1)) * (Product_{j=1..n} i+j)). - Gerry Martens, Mar 10 2011
a(n) = denominator([t^n] 1/(tanh(t)-1)). - Peter Luschny, Aug 04 2011
a(n) = n!/2^A011371(n). - Robert Israel, Jul 23 2015
From Zhujun Zhang, Jun 16 2019: (Start)
a(n) = n!/A060818(n).
E.g.f.: Product_{k>=0} (1 + x^(2^k) / 2^(2^k - 1)).
(End)
log a(n) = n log n - (1 + log 2)n + Θ(log n). - Charles R Greathouse IV, Feb 12 2022

New name (from Amarnath Murthy) by Charles R Greathouse IV, Jul 23 2015

A100258 Triangle of coefficients of normalized Legendre polynomials, with increasing exponents.

Original entry on oeis.org

1, 0, 1, -1, 0, 3, 0, -3, 0, 5, 3, 0, -30, 0, 35, 0, 15, 0, -70, 0, 63, -5, 0, 105, 0, -315, 0, 231, 0, -35, 0, 315, 0, -693, 0, 429, 35, 0, -1260, 0, 6930, 0, -12012, 0, 6435, 0, 315, 0, -4620, 0, 18018, 0, -25740, 0, 12155, -63, 0, 3465, 0, -30030, 0, 90090, 0, -109395, 0, 46189

Offset: 0

Ralf Stephan, Nov 13 2004

For a relation to Jacobi quartic elliptic curves, see the MathOverflow link. For a self-convolution of the polynomials relating them to the Chebyshev and Fibonacci polynomials, see A049310 and A053117. For congruences and connections to other polynomials (Jacobi, Gegenbauer, and Chebyshev) see the Allouche et al. link. For relations to elliptic cohomology and modular forms, see references in Copeland link.- Tom Copeland, Feb 04 2016

			Triangle begins:
   1;
   0,   1;
  -1,   0,     3;
   0,  -3,     0,   5;
   3,   0,   -30,   0,   35;
   0,  15,     0, -70,    0,   63;
  -5,   0,   105,   0, -315,    0,    231;
   0, -35,     0, 315,    0, -693,      0, 429;
  35,   0, -1260,   0, 6930,    0, -12012,   0, 6435;
  ...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 798.

T. D. Noe, Rows n=0..100 of triangle, flattened
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
J. Allouche and G. Skordev, Schur congruences, Carlitz sequences of polynomials and automaticity, Discrete Mathematics, Vol. 214, Issue 1-3, 21 March 2000, p. 21-49.
Tom Copeland, The Elliptic Lie Triad: Riccati and KdV Equations, Infinigens, and Elliptic Genera
H. N. Laden, An historical, and critical development of the theory of Legendre polynomials before 1900, Master of Arts Thesis, University of Maryland 1938.
Shi-Mei Ma, On gamma-vectors and the derivatives of the tangent and secant functions, arXiv:1304.6654 [math.CO], 2013.
MathOverflow, Geometric picture of invariant differential of an elliptic curve, Dec 4 2011.

Without zeros: A008316. Row sums are A060818.
Columns (with interleaved zeros and signs) include A001790, A001803, A100259. Diagonals include A001790, A001800, A001801, A001802.
Cf. A049310, A005187, A049600, A053117.

row[n_] := CoefficientList[ LegendreP[n, x], x]*2^IntegerExponent[n!, 2]; Table[row[n], {n, 0, 10}] // Flatten (* Jean-François Alcover, Jan 15 2015 *)

a(k,n)=polcoeff(pollegendre(k,x),n)*2^valuation(k!,2)

from mpmath import *
mp.dps=20
def a007814(n):
    return 1 + bin(n - 1)[2:].count('1') - bin(n)[2:].count('1')
for n in range(11):
    y=2**sum(a007814(i) for i in range(2, n+1))
    l=chop(taylor(lambda x: legendre(n, x), 0, n))
    print([int(i*y) for i in l]) # Indranil Ghosh, Jul 02 2017

The n-th normalized Legendre polynomial is generated by 2^(-n-a(n)) (d/dx)^n (x^2-1)^n / n! with a(n) = A005187(n/2) for n even and a(n) = A005187((n-1)/2) for n odd. The non-normalized polynomials have the o.g.f. 1 / sqrt(1 - 2xz + z^2). - Tom Copeland, Feb 07 2016

The consecutive nonzero entries in the m-th row are, in order, (c+b)!/(c!(m-b)!(2b-m)!*A048896(m-1)) with sign (-1)^b where c = m/2-1, m/2, m/2+1, ..., (m-1) and b = c+1 if m is even and sign (-1)^c with c = (m-1)/2, (m-1)/2+1, (m-1)/2+2, ..., (m-1) with b = c+1 if m is odd. For the 9th row the 5 consecutive nonzero entries are 315, -4620, 18018, -25740, 12155 given by c = 4,5,6,7,8 and b = 5,6,7,8,9. - Richard Turk, Aug 22 2017

cp's OEIS Frontend

A220371 a(n) = Product_{i=1..2*n} (4*i+2)*A060818(n).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A224270 Absolute values of the numerators of the third column of ( 0 followed by (interleave 0 , A001803(n))/A060818(n) ) and its successive differences.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A180878 Numerator in fraction A180878/A060818.

Views

Author

Keywords

Comments

Crossrefs

Formula

A046161 a(n) = denominator of binomial(2n,n)/4^n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

PARI

PARI

Python

Sage

Formula

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

A034699 Largest prime power factor of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI

Python

A220371 a(n) = Product_{i=1..2n} (4i+2)*A060818(n).

A220466 a((2n-1)2^p) = 4^p(n-1) + 2^(p-1)(1+2^p), p >= 0 and n >= 1.