id:A123931 - OEIS Search Results

Search: id:A123931

Displaying 1-1 of 1 results found.

page 1

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
1

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; listen)

	OFFSET	`0,4`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	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 this_sequence A058026 A004605 A086664` `Adjacent sequences: A123928 A123929 A123930 this_sequence A123932 A123933 A123934`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet Nov 28 2006`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 11 2006`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research