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!)
A136411 a(n) = Product_{k=1..n} (2*k-1)^(2*n-2*k+1). 2
1, 3, 135, 212625, 21097715625, 207248662456171875, 291128066470548703880859375, 79746389028864195813528714933837890625, 5570294521107277357810167397301815834831695556640625 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A107254(n) / 2^(n*(n - 1)).
a(n) = sf(2*n-1) / (2^(n*(n-1)) * sf(n-1)^2), n >= 1, where sf(n) = BarnesG(n + 2) is the superfactorial defined in A000178. - Robert Coquereaux, Apr 02 2013
a(n) ~ A * 2^(n^2 + n - 1/12) * n^(n^2 + 1/12) / exp(3*n^2/2 + 1/12), where A = A074962 = 1.2824271291... is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Jul 10 2015
MATHEMATICA
Table[Product[(2*k - 1)^(2*n - 2*k + 1), {k, 1, n}], {n, 1, 10}] (* Stefan Steinerberger, May 18 2008 *)
sf[n_] := BarnesG[n + 2]; a[n_] := sf[2 n - 1]/(2^(n (n - 1)) sf[n - 1]^2); Table[a[n], {n, 1, 10}] (* Robert Coquereaux, Apr 02 2013 *)
PROG
(PARI) a(n) = prod(k=1, n, (2*k-1)^(2*n-2*k+1)) \\ Anders Hellström, Sep 16 2015
(Magma) [(&*[(2*k-1)^(2*n-2*k+1): k in [1..n]]): n in [1..10]]; // G. C. Greubel, Oct 14 2018
CROSSREFS
Sequence in context: A065973 A110973 A361195 * A193136 A037120 A082923
KEYWORD
easy,nonn
AUTHOR
Ctibor O. Zizka, Mar 31 2008
EXTENSIONS
More terms from Stefan Steinerberger, May 18 2008
STATUS
approved

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 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)