The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054676 Numerator of expected length of longest increasing subsequence of a permutation of length n. 2
 1, 3, 2, 29, 67, 2261, 499, 7601, 163673, 3146141, 16688347, 232429801, 1220661809, 1475887019, 96968880223, 5041994433457, 25104916552337, 4417388168138681, 279381762131009, 383174447010300497, 24854210193336894641, 2271390683068712389, 8081231165699623062227 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..60 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. EXAMPLE A054676/A054677 = 1/1, 3/2, 2/1, 29/12, 67/24, 2261/720, 499/144, 7601/2016, 163673/40320, 3146141/725760, 16688347/3628800, 232429801/47900160, ... . CROSSREFS Cf. A047874, A054677. Sequence in context: A065353 A353757 A046272 * A181994 A350023 A353123 Adjacent sequences: A054673 A054674 A054675 * A054677 A054678 A054679 KEYWORD nonn,frac,nice,easy AUTHOR Eric M. Rains (rains(AT)caltech.edu), Apr 19 2000 EXTENSIONS More terms from Alois P. Heinz, Feb 14 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 06:34 EST 2023. Contains 367717 sequences. (Running on oeis4.)