A160481 -id:A160481 - cp's OEIS frontend

A049606 Largest odd divisor of n!.

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

A160480 The Beta triangle read by rows.

Original entry on oeis.org

-1, -11, 1, -299, 36, -1, -15371, 2063, -85, 1, -1285371, 182474, -8948, 166, -1, -159158691, 23364725, -1265182, 29034, -287, 1, -27376820379, 4107797216, -237180483, 6171928, -77537, 456, -1

Offset: 2

Johannes W. Meijer, May 24 2009, Sep 19 2012

The coefficients of the BS1 matrix are defined by BS1[2*m-1,n] = int(y^(2*m-1)/(cosh(y))^(2*n-1),y=0..infinity)/factorial(2*m-1) for m = 1, 2, ... and n = 1, 2, ... .
This definition leads to BS1[2*m-1,n=1] = 2*beta(2*m), for m = 1, 2, ..., and the recurrence relation BS1 [2*m-1,n] = (2*n-3)/(2*n-2)*(BS1[2*m-1,n-1] - BS1[2*m-3,n-1]/(2*n-3)^2) which we used to extend our definition of the BS1 matrix coefficients to m = 0, -1, -2, ... . We discovered that BS1[ -1,n] = 1 for n = 1, 2, ... . As usual beta(m) = sum((-1)^k/(1+2*k)^m, k=0..infinity).
The coefficients in the columns of the BS1 matrix, for m = 1, 2, 3, ..., and n = 2, 3, 4, ..., can be generated with the GK(z;n) polynomials for which we found the following general expression GK(z;n) = ((-1)^(n+1)*CFN2(z;n)*GK(z;n=1) + BETA(z;n))/p(n).
The CFN2(z;n) polynomials depend on the central factorial numbers A008956.
The BETA(z;n) are the Beta polynomials which lead to the Beta triangle.
The zero patterns of the Beta polynomials resemble a UFO. These patterns resemble those of the Eta, Zeta and Lambda polynomials, see A160464, A160474 and A160487.
The first Maple algorithm generates the coefficients of the Beta triangle. The second Maple algorithm generates the BS1[2*m-1,n] coefficients for m = 0, -1, -2, -3, ... .
Some of our results are conjectures based on numerical evidence, see especially A160481.

			The first few rows of the triangle BETA(n,m) with n=2,3,... and m=1,2,... are
  [ -1],
  [ -11, 1],
  [ -299, 36, -1],
  [ -15371, 2063 -85, 1].
The first few BETA(z;n) polynomials are
  BETA(z;n=2) = -1,
  BETA(z;n=3) = -11 + z^2,
  BETA(z;n=4) = -299 + 36*z^2 - z^4.
The first few CFN1(z;n) polynomials are
  CFN2(z;n=2) = (z^2 - 1),
  CFN2(z;n=3) = (z^4 - 10*z^2 + 9),
  CFN2(z;n=4) = (z^6 - 35*z^4 + 259*z^2 - 225).
The first few generating functions GK(z;n) are
  GK(z;n=2) = ((-1)*(z^2-1)*GK(z,n=1) + (-1))/2,
  GK(z;n=3) = ((z^4 - 10*z^2 + 9)*GK(z,n=1)+ (-11 + z^2))/24,
  GK(z;n=4) = ((-1)*(z^6 - 35*z^4 + 259*z^2 - 225)*GK(z,n=1) + (-299 + 36*z^2 - z^4))/720.

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.
J. M. Amigo, Relations among Sums of Reciprocal Powers Part II, International Journal of Mathematics and Mathematical Sciences , Volume 2008 (2008), pp. 1-20.
Johannes W. Meijer, The zeros of the Eta, Zeta, Beta and Lambda polynomials, jpg and pdf, Mar 03 2013.

A160481 equals the rows sums.
A101269 and A160482 equal the first and second left hand columns.
A160483 and A160484 equal the second and third right hand columns.
A160485 and A160486 are two related triangles.
The CFN2(z, n) and the cfn2(n, k) lead to A008956.
Cf. the Eta, Zeta and Lambda triangles: A160464, A160474 and A160487.
Cf. A162443 (BG1 matrix).

nmax := 8; mmax := nmax: for n from 1 to nmax do BETA(n, n) := 0 end do: m := 1: for n from m+1 to nmax do BETA(n, m) := (2*n-3)^2*BETA(n-1, m) - (2*n-4)! od: for m from 2 to mmax do for n from m+1 to nmax do BETA(n, m) := (2*n-3)^2*BETA(n-1, m) - BETA(n-1, m-1) od: od: seq(seq(BETA(n, m), m=1..n-1), n= 2..nmax);
# End first program
nmax1 := 25; m := 1; BS1row := 1-2*m; 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: mmax1 := nmax1: for m1 from 1 to mmax1 do BS1[1-2*m1, 1] := euler(2*m1-2) od: for n from 2 to nmax1 do for m1 from 1 to mmax1-n+1 do BS1[1-2*m1, n] := (-1)^(n+1)*sum((-1)^(k1+1)*cfn2(n-1, k1-1) * BS1[2*k1-2*n-2*m1+1, 1], k1 =1..n)/(2*n-2)! od: od: seq(BS1[1-2*m, n], n=1..nmax1-m+1);
# End second program

BETA[2, 1] = -1;
BETA[n_, 1] := BETA[n, 1] = (2*n - 3)^2*BETA[n - 1, 1] - (2*n - 4)!;
BETA[n_ /; n > 2, m_ /; m > 0] /; 1 <= m <= n := BETA[n, m] = (2*n - 3)^2*BETA[n - 1, m] - BETA[n - 1, m - 1];
BETA[, ] = 0;
Table[BETA[n, m], {n, 2, 9}, {m, 1, n - 1}] // Flatten (* Jean-François Alcover, Dec 13 2017 *)

We discovered a relation between the Beta triangle coefficients BETA(n,m) = (2*n-3)^2* BETA(n-1,m)- BETA(n-1,m-1) for n = 3, 4, ... and m = 2, 3, ... with BETA(n,m=1) = (2*n-3)^2*BETA(n-1,m=1) - (2*n-4)! for n = 2, 3, ... and BETA(n,n) = 0 for n = 1, 2, ... .
The generating functions GK(z;n) of the coefficients in the matrix columns are defined by
GK(z;n) = sum(BS1[2*m-1,n]*z^(2*m-2), m=1..infinity) with n = 1, 2, ... .
This definition leads to GK(z;n=1) = 1/(z*cos(Pi*z/2))*int(sin(z*t)/sin(t),t=0..Pi/2).
Furthermore we discovered that GK(z;n) = GK(z;n-1)*((2*n-3)/(2*n-2)-z^2/((2*n-2)*(2*n-3)))-1/((2*n-2)*(2*n-3)) for n = 2, 3, ... .
We found the following general expression for the GK(z;n) polynomials, for n = 2, 3, ...,
GK(z;n) = ((-1)^(n+1)*CFN2(z;n)*GK(z;n=1) + BETA(z;n))/p(n) with p(n) = (2*n-2)!.

A120778 Numerators of partial sums of Catalan numbers scaled by powers of 1/4.

Original entry on oeis.org

1, 5, 11, 93, 193, 793, 1619, 26333, 53381, 215955, 436109, 3518265, 7088533, 28539857, 57414019, 1846943453, 3711565741, 14911085359, 29941580393, 240416274739, 482473579583, 1936010885087, 3883457090629, 62306843256889

Offset: 0

Wolfdieter Lang, Jul 20 2006

For denominators see A120777.
From the expansion of 0 = sqrt(1-1) = 1 - (1/2)*Sum_{k>=0} C(k)/4^k one has r:=lim_{n->infinity} r(n) = 2, with the partial sums r(n) defined below.
The series a(n)/A046161(n+1) is absolutely convergent to 1. - Ralf Steiner, Feb 16 2017
If n >= 1 it appears a(n-1) is equal to the difference between the denominator and the numerator of the ratio (2n)!!/(2n-1)!!. In particular a(n-1) is the difference between the denominator and the numerator of the ratio A001147(2n-1)/A000165(2n). See examples. - Anthony Hernandez, Feb 05 2020
From Peter Bala, Feb 16 2022: (Start)
Sum_{k = 0..n-1} Catalan(k)/4^k = (1/4^n)*(2*n)*binomial(2*n,n) *( 1 - 1/(1*2)*(n-1)/(n+1) - 1/(2*3)*(n-1)*(n-2)/((n+1)*(n+2)) - 1/(3*4)*(n-1)*(n-2)*(n-3)/((n+1)*(n+2)*(n+3)) - 1/(4*5)*(n-1)*(n-2)*(n-3)*(n-4)/((n+1)*(n+2)*(n+3)*(n+4)) - ... ). Cf. A082687 and A101028.
This identity allows us to extend the definition of Sum_{k = 0..n} Catalan(k)/4^k to non-integral values of n. (End)

			Rationals r(n): [1, 5/4, 11/8, 93/64, 193/128, 793/512, 1619/1024, 26333/16384, ...].
From _Anthony Hernandez_, Feb 05 2020: (Start)
For n = 4. The 4th even number is 8, and 8!!/(8-1)!! = 128/35, so a(4-1) = a(3) = 128 - 35 = 93.
For n = 7. The 7th even number is 14, and 14!!/(14-1)!! = 2048/429, so a(7-1) = a(6) = 2048 - 429 = 1619. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..100
Wolfdieter Lang, Rationals r(n) and limit 2

Factors of A160481. Cf. A120777 (denominators), A082687, A101028, A141244.

[Numerator(2*(1-Binomial(2*n+2,n+1)/4^(n+1))): n in [0..25]]; // Vincenzo Librandi, Feb 17 2017

a := n -> 2^(2*(n+1) - add(i, i=convert(n+1, base, 2)))* (1-((n+1/2)!)/(sqrt(Pi)*(n+1)!)): seq(simplify(a(n)), n=0..23); # Peter Luschny, Dec 21 2017

f[n_] := f[n] = Numerator[(4/Pi) (n + 1) Integrate[x^n*ArcSin[Sqrt[x]], {x, 0, 1}]]; Array[f, 23, 0] (* Robert G. Wilson v, Jan 03 2011 *)
a[n_] := 2^(2(n+1) - DigitCount[n+1,2,1])(1 - ((n+1/2)!)/(Sqrt[Pi](n+1)!));
Table[a[n], {n, 0, 23}] (* Peter Luschny, Dec 21 2017 *)

a(n) = numerator(r(n)), with the rationals r(n):=Sum_{k = 0..n} C(k)/4^k with C(k) := A000108(k) (Catalan numbers). Rationals r(n) are taken in lowest terms.
r(n) = (4/Pi)*(n+1)*Integral_{x = 0..1} x^n*arcsin(sqrt(x)) dx. - Groux Roland, Jan 03 2011
r(n) = 2*(1 - binomial(2*n+2,n+1)/4^(n+1)). - Groux Roland, Jan 04 2011
a(n) = A141244(2n+2) = A141244(2n+3) (conjectural). - Greg Martin, Aug 16 2014, corrected by M. F. Hasler, Aug 18 2014
From Peter Luschny, Dec 21 2017: (Start)
a(n) = numerator(1 - ((n+1/2)!)/(sqrt(Pi)*(n+1)!)).
a(n) = 2^(2*(n+1) - HammingWeight(n+1))*(1 - ((n+1/2)!)/(sqrt(Pi)*(n+1)!)). (End)

cp's OEIS Frontend

A049606 Largest odd divisor of n!.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A160480 The Beta triangle read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A120778 Numerators of partial sums of Catalan numbers scaled by powers of 1/4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula