Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2.

Terms

a(0) =0a(1) =0a(2) =0a(3) =10a(4) =175a(5) =1131a(6) =4501a(7) =13588a(8) =34245a(9) =75925a(10) =152911a(11) =285726a(12) =502723a(13) =841855a(14) =1352625a(15) =2098216a(16) =3157801a(17) =4629033a(18) =6630715a(19) =9305650a(20) =12823671a(21) =17384851a(22) =23222893a(23) =30608700a(24) =39854125a(25) =51315901a(26) =65399751a(27) =82564678a(28) =103327435a(29) =128267175