|
Search: id:A001892
|
|
|
| A001892 |
|
Number of permutations by inversions. (Formerly M1477 N0583)
|
|
+0 3
|
|
| 1, 2, 5, 15, 49, 169, 602, 2191, 8095, 30239, 113906, 431886, 1646177, 6301715, 24210652, 93299841, 360490592, 1396030396, 5417028610, 21056764914, 81978913225, 319610939055, 1247641114021, 4875896455975
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 241.
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+1}/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-2), n=2..40);
|
|
CROSSREFS
|
Cf. A008302.
Sequence in context: A149937 A149938 A148365 this_sequence A084082 A149939 A149940
Adjacent sequences: A001889 A001890 A001891 this_sequence A001893 A001894 A001895
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy
|
|
EXTENSIONS
|
More terms, Maple code, asymptotic formula from Barbara Haas Margolius (margolius(AT)math.csuohio.edu) 5/31/01
|
|
|
Search completed in 0.043 seconds
|