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