login
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).
5
1, 3, 10, 46, 264, 1773, 13719, 120770, 1190358, 12961563, 154466259, 2000471830, 27980585221
OFFSET
1,2
COMMENTS
We also have data for the number of permutations pi that have k(pi)=r for r>=1.
LINKS
A. Godbole, Publications (lists some related sequences)
Manfred Scheucher, C Code
CROSSREFS
Sequence in context: A058112 A345132 A020008 * A000849 A092429 A218919
KEYWORD
nonn,more
AUTHOR
Anant Godbole, Stephanie Goins, Brad Wild, Nov 16 2009
EXTENSIONS
a(9)-a(13) from Manfred Scheucher, Jun 07 2015
STATUS
approved