The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055980 Floor[sum(1/i)], 1<=i<=n. 8
 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; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS 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 a(n) = A214075(n,n-1) for n > 0. - Reinhard Zumkeller, Jul 03 2012 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 L. D. Kudryavtsev, Harmonic series Eric Weisstein's World of Mathematics, High-Water Mark FORMULA a(n) ~ log(n) - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001 a(n)=Floor[A001008(n)/A002805(n)]. - Lekraj Beedassy, Sep 17 2006 PROG (Haskell) import Data.Ratio ((%), denominator) a055980 = floor . sum . map (1 %) . enumFromTo 1 a055980_list = map floor \$ scanl1 (+) \$ map (1 %) [1..] -- Reinhard Zumkeller, Jul 03 2012 CROSSREFS Cf. A002387, A004080 (indices of records). Sequence in context: A191517 A303370 A082528 * A076080 A134914 A329195 Adjacent sequences:  A055977 A055978 A055979 * A055981 A055982 A055983 KEYWORD nonn AUTHOR Henry Bottomley, Jul 20 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 23:03 EST 2020. Contains 331270 sequences. (Running on oeis4.)