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=6x10^6.
There was 1 permutation for which L_n was 4834, 1 for which
it was 4837, and so forth.
1 4835
1 4837
3 4838
2 4840
2 4841
3 4842
6 4843
7 4844
13 4845
16 4846
11 4847
23 4848
32 4849
27 4850
34 4851
44 4852
62 4853
69 4854
66 4855
92 4856
100 4857
120 4858
137 4859
159 4860
196 4861
173 4862
233 4863
226 4864
222 4865
270 4866
288 4867
324 4868
285 4869
293 4870
306 4871
301 4872
330 4873
322 4874
315 4875
317 4876
325 4877
307 4878
324 4879
316 4880
289 4881
276 4882
251 4883
224 4884
230 4885
202 4886
212 4887
195 4888
167 4889
170 4890
125 4891
117 4892
109 4893
84 4894
96 4895
77 4896
65 4897
66 4898
46 4899
47 4900
41 4901
34 4902
31 4903
22 4904
30 4905
23 4906
9 4907
11 4908
11 4909
7 4910
5 4911
3 4912
6 4913
5 4914
2 4915
1 4917
4 4918
1 4920
1 4921
1 4922
1 4923