Values of L_n, the length of the longest increasing subsequence
in 10^4 random permutations of {1, 2, ... , n} for n=2x10^4.
There were 3 permutations for which L_n was 260, 8 for which
it was 261, and so forth.
3 260
8 261
10 262
24 263
76 264
96 265
189 266
262 267
378 268
494 269
652 270
720 271
857 272
848 273
859 274
861 275
738 276
677 277
550 278
463 279
372 280
276 281
201 282
112 283
105 284
70 285
32 286
24 287
19 288
12 289
8 290
3 291
1 292