%N 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).
%C We also have data for the number of permutations pi that have k(pi)=r for r>=1.
%H A. Godbole, <a href="http://faculty.etsu.edu/godbolea/Publications.pdf">Publications</a> (lists some related sequences)
%H Manfred Scheucher, <a href="/A167999/a167999.c.txt">C Code</a>
%Y Cf. A167995, A168502.
%A _Anant Godbole_, Stephanie Goins, Brad Wild, Nov 16 2009
%E a(9)-a(13) from _Manfred Scheucher_, Jun 07 2015