|
Search: id:A115107
|
|
|
| A115107 |
|
Numerator of q_n = -4n + 2(1+n)*HarmonicNumber(n). |
|
+0
2
|
|
| 0, 1, 8, 29, 37, 103, 472, 2369, 2593, 30791, 32891, 452993, 476753, 499061, 2080328, 18358463, 18999103, 124184839, 127860511, 26274175, 8982005, 211524139, 648798629, 16562041459, 16891532467, 154883957203, 157646059403, 4649180818987, 4724140023307
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Average time to quicksort n items in random order.
|
|
REFERENCES
|
P. J. Cameron, Combinatorics, Cambridge Univ. Press, 1996, see p. 68.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Quicksort
|
|
EXAMPLE
|
0, 1, 8/3, 29/6, 37/5, 103/10, 472/35, 2369/140, 2593/126, ...
|
|
MATHEMATICA
|
f[n_] := Numerator[ -4n + 2(n + 1)HarmonicNumber[n]]; Array[f, 29] (from Robert G. Wilson v (rgwv(at)rgwv.com), May 01 2006)
|
|
CROSSREFS
|
Cf. A093418, A096620.
Sequence in context: A146977 A068623 A155578 this_sequence A035339 A034167 A093809
Adjacent sequences: A115104 A115105 A115106 this_sequence A115108 A115109 A115110
|
|
KEYWORD
|
nonn,frac
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 07 2006
|
|
|
Search completed in 0.005 seconds
|
