login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095987 GCD(n!!,(n-1)!!) where n!! = A006882. 0
1, 1, 1, 1, 1, 3, 3, 3, 3, 15, 15, 45, 45, 315, 315, 315, 315, 2835, 2835, 14175, 14175, 155925, 155925, 467775, 467775, 6081075, 6081075, 42567525, 42567525, 638512875, 638512875, 638512875, 638512875, 10854718875, 10854718875 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

Let f_n(m) be a multifactorial: for m = positive integer, f_n(m) = product{k=0 to floor((m-1)/n)} (m - k*n). E.g. f_2(m) = m!!. f_n(0) is defined as 1.

a(2m) = a(2m+1) = the largest odd divisor of m! (which is A049606).

MATHEMATICA

f[n_] := GCD[n!!, (n - 1)!! ]; Table[ f[n], {n, 35}]

CROSSREFS

a(2n) gives A049606.

Sequence in context: A029630 A170858 A024725 * A098535 A069239 A010265

Adjacent sequences:  A095984 A095985 A095986 * A095988 A095989 A095990

KEYWORD

nonn

AUTHOR

Leroy Quet Jul 18 2004

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 19 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 08:49 EST 2012. Contains 205740 sequences.