Triangle read by rows: T(n,k) = number of heapable permutations of length n that contain the max element on position k (positions starting from 0).
A390546
Triangle read by rows: T(n,k) = number of heapable permutations of length n that contain the max element on position k (positions starting from 0).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =2a(9) =2a(10) =0a(11) =2a(12) =5a(13) =5a(14) =5a(15) =0a(16) =5a(17) =15a(18) =17a(19) =17a(20) =17a(21) =0a(22) =17a(23) =58a(24) =71a(25) =71a(26) =71a(27) =71a(28) =0a(29) =71
External references
- oeis: A390546