|
Search: id:A005283
|
|
|
| A005283 |
|
Number of permutations by inversions.
(Formerly M3905)
|
|
+0
5
|
|
| 1, 5, 20, 76, 285, 1068, 4015, 15159, 57486, 218895, 836604, 3208036, 12337630, 47572239, 183856635, 712033264, 2762629983, 10736569602, 41788665040, 162869776650, 635562468075, 2482933033659, 9710010151831, 38008957336974, 148912655255315, 583885852950802
(list; graph; listen)
|
|
|
OFFSET
|
5,2
|
|
|
REFERENCES
|
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 241.
R. K. Guy, personal communication.
R. H. Moritz and R. C. Williams, A coin-tossing problem and some related combinatorics, Math. Mag., 61 (1988), 24-29.
E. Netto, Lehrbuch der Combinatorik. 2nd ed., Teubner, Leipzig, 1927, p. 96.
|
|
LINKS
|
B. H. Margolius, Permutations with inversions, J. Integ. Seqs. Vol. 4 (2001), #01.2.4.
|
|
FORMULA
|
a(n)=2^{2n+4}/sqrt{pi n}Q(1+O(n^{-1})) where Q is a digital search tree constant, Q = 0.2887880951...
|
|
MAPLE
|
f := (x, n)->product((1-x^j)/(1-x), j=1..n); seq(coeff(series(f(x, n), x, n+2), x, n-5), n=5..40);
|
|
CROSSREFS
|
Cf. A008302, A005284.
Sequence in context: A000344 A061278 A000758 this_sequence A057552 A129869 A079737
Adjacent sequences: A005280 A005281 A005282 this_sequence A005284 A005285 A005286
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms, Maple code, asymptotic formula from Barbara Haas Margolius (margolius(AT)math.csuohio.edu) 5/31/01
|
|
|
Search completed in 0.002 seconds
|
