login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103639 a(n) = Product_{i=1..2*n} (2*i+1). 6

%I #32 Jan 30 2022 09:53:06

%S 1,15,945,135135,34459425,13749310575,7905853580625,6190283353629375,

%T 6332659870762850625,8200794532637891559375,

%U 13113070457687988603440625,25373791335626257947657609375,58435841445947272053455474390625,157952079428395476360490147277859375

%N a(n) = Product_{i=1..2*n} (2*i+1).

%H G. C. Greubel, <a href="/A103639/b103639.txt">Table of n, a(n) for n = 0..175</a>

%F a(n) = (4*n+2)! / (2 * 4^n * (2*n+1)! ).

%F E.g.f.: sinh(x^2/2) = x^2/2! + 15*x^6/6! + 945*x^10/10! +...

%F a(n+1) = (4*n-1)*(4*n+1)*a(n), a(0) = 1.

%F a(n) = (4*n+1)!!. - _Vladimir Reshetnikov_, Nov 03 2015

%F a(n) = denominator((-3/2 - 2*n)!/sqrt(Pi)). - _Peter Luschny_, Jun 21 2020

%e Sequence starts 1, 1*3*5, 1*3*5*7*9, 1*3*5*7*9*11*13, ...

%p A103639 := n -> pochhammer(1/2,2*n+1)*2^(2*n+1):

%p seq(A103639(n), n=0..11); # _Peter Luschny_, Dec 19 2012

%t Table[(4n+1)!!, {n, 0, 15}] (* _Vladimir Reshetnikov_, Nov 03 2015 *)

%o (Sage)

%o def A103639(n):

%o return falling_factorial(4*n+2,2*n+1)*2^(-1-2*n)

%o print([A103639(n) for n in (0..11)]) # _Peter Luschny_, Dec 14 2012

%o (PARI) vector(20, n, n--; prod(i=1, 2*n, 2*i+1)) \\ _Altug Alkan_, Nov 04 2015

%o (Magma) [(n+1)*Factorial(2*n+1)*Catalan(2*n+1)/4^n: n in [0..20]]; // _G. C. Greubel_, Jan 29 2022

%Y Bisection of the double factorials A001147.

%Y Cf. A102992.

%Y Cf. Odd part of A024343 and A009564.

%K nonn

%O 0,2

%A _Ralf Stephan_, Feb 18 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)