A258683 Total number of permutations on {1,2,...,n} that have a unique longest increasing subsequence and a unique longest decreasing subsequence.

1, 0, 0, 0, 2, 16, 120, 938, 8014, 74060, 748628, 8163156, 96429784

Offset

1,5

Comments

By definition, a(n) <= A167995(n).

Links

Table of n, a(n) for n=1..13.

Manfred Scheucher, C Code

Example

the two permutation of {1,2,...,5}:
{2, 5, 3, 1, 4}
{4, 1, 3, 5, 2}
8 of the 16 permutations of {1,2,...,6} (others reversed):
{1, 3, 6, 4, 2, 5}
{1, 5, 2, 4, 6, 3}
{2, 3, 6, 4, 1, 5}
{2, 5, 3, 1, 4, 6}
{2, 6, 3, 1, 4, 5}
{2, 6, 5, 3, 1, 4}
{3, 6, 4, 2, 1, 5}
{3, 6, 4, 2, 5, 1}

Prog

(Sage)
def A258683(n):
    return len([p for p in permutations(n) if len(p.longest_increasing_subsequences())* len(p.reverse().longest_increasing_subsequences())==1])
# Manfred Scheucher, Jun 07 2015

Crossrefs

Cf. A167995, A167999, A168502.

Sequence in context: A112710 A046105 A086854 * A026129 A026158 A025185

Adjacent sequences: A258680 A258681 A258682 * A258684 A258685 A258686

Keyword

nonn,more

Author

Manfred Scheucher, Jun 07 2015

Status

approved