id:A014973 - OEIS Search Results

Search: id:A014973

Displaying 1-1 of 1 results found.

page 1

n/GCD(n,(n-1)!).

+0
4

1, 2, 3, 2, 5, 1, 7, 1, 1, 1, 11, 1, 13, 1, 1, 1, 17, 1, 19, 1, 1, 1, 23, 1, 1, 1, 1, 1, 29, 1, 31, 1, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 1, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 1, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 1, 1, 83, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Denominator in n!/n^2. Also denominator in Taylor series expansion of dilog function (also called Li_2). - Ralf Stephan, Mar 28 2004`
	FORMULA	`a(4) = 2; otherwise a(n) = 1 unless n is a prime in which case a(n) = n. - Ola Veshta (olaveshta(AT)my-deja.com), May 30 2001.` `a(n) = denominator((i-1)! * sum(i=1, n, 1 - 1/i)) - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 16 2004`
	CROSSREFS	`Sequence in context: A130069 A120007 A092509 this_sequence A157753 A020500 A014963` `Adjacent sequences: A014970 A014971 A014972 this_sequence A014974 A014975 A014976`
	KEYWORD	`nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.

AT&T Labs Research