Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095987
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095987 GCD(n!!,(n-1)!!) where n!! = A006882. +0
1
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; listen)
OFFSET

0,6

COMMENT

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).

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

MATHEMATICA

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

CROSSREFS

a(2n) gives A049606.

Sequence in context: A001270 A029630 A024725 this_sequence A098535 A069239 A010265

Adjacent sequences: A095984 A095985 A095986 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research