|
Search: id:A054677
|
|
|
| A054677 |
|
Denominator of expected length of longest increasing subsequence of a permutation of length n. |
|
+0
2
|
|
| 1, 2, 1, 12, 24, 720, 144, 2016, 40320, 725760, 3628800, 47900160, 239500800, 276756480, 17435658240, 871782912000, 4184557977600, 711374856192000, 43553562624000, 57926238289920000, 3649353012264960000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
A. M. Odlyzko and E. M. Rains, On longest increasing subsequences in random permutations, pp. 439-451 in Analysis, Geometry, Number Theory: The Mathematics of Leon Ehrenpreis, E. L. Grinberg, S. Berhanu, M. Knopp, G. Mendoza and E. T. Quinto, eds., Amer. Math. Soc., Contemporary Math. #251, 2000.
|
|
CROSSREFS
|
Cf. A054676.
Sequence in context: A110060 A061081 A007368 this_sequence A012929 A013161 A012926
Adjacent sequences: A054674 A054675 A054676 this_sequence A054678 A054679 A054680
|
|
KEYWORD
|
nonn,frac,nice,easy
|
|
AUTHOR
|
Eric M. Rains (rains(AT)caltech.edu), Apr 19 2000
|
|
|
Search completed in 0.002 seconds
|
