|
| |
|
|
A054676
|
|
Numerator of expected length of longest increasing subsequence of a permutation of length n.
|
|
1
|
|
|
|
1, 3, 2, 29, 67, 2261, 499, 7601, 163673, 3146141, 16688347, 232429801, 1220661809, 1475887019, 96968880223, 5041994433457, 25104916552337, 4417388168138681, 279381762131009, 383174447010300497
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Table of n, a(n) for n=1..20.
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. A054677.
Sequence in context: A102056 A065353 A046272 * A181994 A154332 A136635
Adjacent sequences: A054673 A054674 A054675 * A054677 A054678 A054679
|
|
|
KEYWORD
|
nonn,frac,nice,easy
|
|
|
AUTHOR
|
Eric M. Rains (rains(AT)caltech.edu), Apr 19 2000
|
|
|
STATUS
|
approved
|
| |
|
|
