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).
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).
Terms
- a(0) =1a(1) =3a(2) =10a(3) =46a(4) =264a(5) =1773a(6) =13719a(7) =120770a(8) =1190358a(9) =12961563a(10) =154466259a(11) =2000471830a(12) =27980585221
External references
- oeis: A167999