LongestIncreasingSubsequenceCount on Permutation

The number of longest increasing subsequences of p.

On Permutation

Called as CombinatorialStat(x, "LongestIncreasingSubsequenceCount"). The head's page has its examples.

Live

Distribution

Over SymmetricGroup at each size, tallied here in your browser; sizes past 8 are not offered.

Sizes 1 to

FindStat St000883

The number of longest increasing subsequences of a permutation.

Object	Value
[]	1
[1]	1
[1,2]	1
[2,1]	2
[1,2,3]	1
[1,3,2]	2
[2,1,3]	2
[2,3,1]	1

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000883 has the rest.