Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).
A318354
Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =2a(6) =5a(7) =3a(8) =3a(9) =5a(10) =16a(11) =11a(12) =8a(13) =11a(14) =16a(15) =62a(16) =46a(17) =35a(18) =35a(19) =46a(20) =62a(21) =286a(22) =224a(23) =178a(24) =143a(25) =178a(26) =224a(27) =286a(28) =1519a(29) =1233
External references
- oeis: A318354