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=3x10^5.
There was 1 permutations for which L_n was 1057, 4 for which 
it was 1060, and so forth.


1     1057
4     1060
7     1061
4     1062
14    1063
28    1064
25    1065
51    1066
76    1067
94    1068
118   1069
154   1070
221   1071
264   1072
317   1073
370   1074
421   1075
411   1076
478   1077
524   1078
554   1079
537   1080
548   1081
547   1082
541   1083
523   1084
464   1085
382   1086
424   1087
344   1088
267   1089
247   1090
216   1091
170   1092
140   1093
110   1094
88    1095
75    1096
65    1097
42    1098
39    1099
25    1100
20    1101
18    1102
11    1103
8     1104
5     1105
3     1106
2     1107
1     1108
1     1109
1     1112