A167999 A permutation pi on [1,2,....n] has k(pi) longest increasing subsequences associated with it; 1<= k(pi)<= f(n) for some function f. The given sequence enumerates sum_pi k(pi).

1, 3, 10, 46, 264, 1773, 13719, 120770, 1190358, 12961563, 154466259, 2000471830, 27980585221, 420293114244, 6746251119942

Offset

1,2

Comments

We also have data for the number of permutations pi that have k(pi)=r for r>=1.

Links

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

A. Godbole, Publications (lists some related sequences)

Manfred Scheucher, C Code

Crossrefs

Cf. A167995, A168502.

Sequence in context: A058112 A345132 A020008 * A000849 A092429 A218919

Adjacent sequences: A167996 A167997 A167998 * A168000 A168001 A168002

Keyword

nonn,more,changed

Author

Anant Godbole, Stephanie Goins, Brad Wild, Nov 16 2009

Extensions

a(9)-a(13) from Manfred Scheucher, Jun 07 2015

a(14)-a(15) from E. Senn, May 29 2026

Status

approved