Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k increasing runs.
A389487
Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k increasing runs.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =4a(8) =0a(9) =0a(10) =1a(11) =11a(12) =5a(13) =0a(14) =0a(15) =1a(16) =26a(17) =41a(18) =3a(19) =0a(20) =0a(21) =1a(22) =57a(23) =212a(24) =86a(25) =3a(26) =0a(27) =0a(28) =1a(29) =120
External references
- oeis: A389487