cp's OEIS Frontend

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).

%I A167999 #19 Jun 07 2015 19:16:10
%S A167999 1,3,10,46,264,1773,13719,120770,1190358,12961563,154466259,
%T A167999 2000471830,27980585221
%N 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).
%C A167999 We also have data for the number of permutations pi that have k(pi)=r for r>=1.
%H A167999 A. Godbole, <a href="http://faculty.etsu.edu/godbolea/Publications.pdf">Publications</a> (lists some related sequences)
%H A167999 Manfred Scheucher, <a href="/A167999/a167999.c.txt">C Code</a>
%Y A167999 Cf. A167995, A168502.
%K A167999 nonn,more
%O A167999 1,2
%A A167999 _Anant Godbole_, Stephanie Goins, Brad Wild, Nov 16 2009
%E A167999 a(9)-a(13) from _Manfred Scheucher_, Jun 07 2015