id:A055980 - OEIS Search Results

Search: id:A055980

Displaying 1-1 of 1 results found.

page 1

Floor[sum(1/i)], 1<=i<=n.

+0
4

1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`If we choose at random (uniformly) a permutation in the symmetric group S_n then a(n) is the expected number of cycles (rounded down) in the cycle decomposition of the permutation. - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Oct 17 2001`
	LINKS	`Eric Weisstein's World of Mathematics, High-Water Mark` `L. D. Kudryavtsev, Harmonic series`
	FORMULA	`a(n) ~ log(n) - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001` `a(n)=Floor[A001008(n)/A002805(n)]. - Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 17 2006`
	CROSSREFS	`Cf. A004080.` `Sequence in context: A109829 A054125 A082528 this_sequence A076080 A134914 A115338` `Adjacent sequences: A055977 A055978 A055979 this_sequence A055981 A055982 A055983`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jul 20 2000`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research