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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123931 a(n) = H(n)*n!/(floor(n/2))! (mod (n+1)), where H(n) = sum{k=1 to n} 1/k, the n-th harmonic number. 0
0, 1, 0, 3, 0, 5, 0, 2, 3, 4, 0, 0, 0, 6, 9, 0, 0, 0, 0, 0, 18, 10, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 30, 16, 0, 0, 0, 18, 24, 0, 0, 0, 0, 0, 0, 22, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 54, 28, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 36, 0, 0, 0, 0, 0, 0, 0, 40, 0, 0, 0, 42, 51, 0, 0, 0, 0, 0, 3, 46, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

MATHEMATICA

f[n_] := Mod[HarmonicNumber[n]n!/Floor[n/2]!, n + 1]; Table[f[n], {n, 0, 100}] (*Chandler*)

CROSSREFS

Cf. A124078.

Sequence in context: A166586 A122274 A003966 * A058026 A004605 A175919

Adjacent sequences:  A123928 A123929 A123930 * A123932 A123933 A123934

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Nov 28 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 11 2006

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 16 06:16 EST 2012. Contains 205860 sequences.