Table T(n,k) counts the involutions of n with longest increasing contiguous subsequence of length k.
A178249
Table T(n,k) counts the involutions of n with longest increasing contiguous subsequence of length k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =6a(8) =2a(9) =1a(10) =1a(11) =14a(12) =8a(13) =2a(14) =1a(15) =1a(16) =37a(17) =27a(18) =8a(19) =2a(20) =1a(21) =1a(22) =96a(23) =94a(24) =30a(25) =8a(26) =2a(27) =1a(28) =1a(29) =270
External references
- oeis: A178249