Jon A. Wellner

Values of L_n, the length of the longest increasing subsequence 
in 10^4 random permutations of {1, 2, ... , n}  for n=2x10^5.
There was 1 permutations for which L_n was 858, 2 for which 
it was 860, and so forth.


1     858
2     860
4     861
3     862
13    863
14    864
33    865
37    866
45    867
76    868
114   869
125   870
188   871
251   872
283   873
346   874
417   875
429   876
526   877
550   878
554   879
643   880
589   881
566   882
571   883
499   884
511   885
443   886
375   887
342   888
298   889
230   890
210   891
154   892
137   893
102   894
75    895
61    896
52    897
34    898
30    899
21    900
15    901
12    902
2     903
4     904
3     905
5     906
3     907
1     910
1     912