login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I

%S 1,3,10,46,264,1773,13719,120770,1190358,12961563,154466259,

%T 2000471830,27980585221

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

%K nonn,more

%O 1,2

%A _Anant Godbole_, Stephanie Goins, Brad Wild, Nov 16 2009

%E a(9)-a(13) from _Manfred Scheucher_, Jun 07 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 19:31 EDT 2021. Contains 343573 sequences. (Running on oeis4.)