The number of permutations in the symmetric group S_n in which it is possible to find two disjoint increasing subsequences each with length equal to the length of the longest increasing subsequence of the permutation.
A331883
The number of permutations in the symmetric group S_n in which it is possible to find two disjoint increasing subsequences each with length equal to the length of the longest increasing subsequence of the permutation.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =5a(4) =26a(5) =132a(6) =834a(7) =6477a(8) =56242
External references
- oeis: A331883