Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k consecutive pairs.
A389993
Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k consecutive pairs.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =3a(8) =1a(9) =1a(10) =2a(11) =4a(12) =8a(13) =2a(14) =1a(15) =7a(16) =22a(17) =22a(18) =17a(19) =2a(20) =1a(21) =38a(22) =100a(23) =119a(24) =70a(25) =28a(26) =3a(27) =1a(28) =225a(29) =588
External references
- oeis: A389993