The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A190901 a(n) = Product_{k in M_n} k; M_n = {k | 1 <= k <= 2n and k mod 2 = n mod 2}. 2
1, 1, 8, 15, 384, 945, 46080, 135135, 10321920, 34459425, 3715891200, 13749310575, 1961990553600, 7905853580625, 1428329123020800, 6190283353629375, 1371195958099968000, 6332659870762850625, 1678343852714360832000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Peter Luschny, Multifactorials
FORMULA
a(2*k) = A006882(4*k) = 4^k * Gamma(2*k+1).
a(2*k+1) = A001147(2*k+1) = 4^k * Gamma(2*k+3/2) / sqrt(Pi/4).
MAPLE
A190901 := proc(n) local k; mul(k, k = select(k-> k mod 2 = n mod 2, [$1 .. 2*n])) end: seq(A190901(n), n=0..18);
MATHEMATICA
a[n_] := With[{m = Mod[n, 2]}, Product[If[Mod[k, 2] == m, k, 1], {k, 1, 2*n}]]; Table[a[n], {n, 0, 18}] (* Jean-François Alcover, Jan 27 2014 *)
CROSSREFS
Sequence in context: A212593 A153700 A343210 * A066916 A131446 A061746
KEYWORD
nonn
AUTHOR
Peter Luschny, Jun 23 2011
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 May 17 12:26 EDT 2024. Contains 372600 sequences. (Running on oeis4.)