For each permutation of {1,2,...,n} one or more integers might not be part of any longest increasing subsequence (LIS) of that permutation. The sequence lists the number of permutations for which ceiling(n/2) is not part of any LIS. For example, if n=4, 2 is not in any LIS of the two permutations (1342) and (3421).

A168502

For each permutation of {1,2,...,n} one or more integers might not be part of any longest increasing subsequence (LIS) of that permutation. The sequence lists the number of permutations for which ceiling(n/2) is not part of any LIS. For example, if n=4, 2 is not in any LIS of the two permutations (1342) and (3421).

Terms

    a(0) =0a(1) =0a(2) =0a(3) =2a(4) =15a(5) =122a(6) =990a(7) =9210a(8) =91013a(9) =1001285a(10) =11774254a(11) =150849588a(12) =2059781391

External references