What power of two divides a weighted Catalan number? (Q2371304)

For the Catalan numbers \(C_{n}\) if \(s(n)\) denotes the sum of digits in the binary expansion of \(n\), and \(\xi (n)\) the largest power of two dividing \(n\), then (this comes back to Kummer) \(\xi (C_{n})=s(n+1)-1\). In this paper, a recently given combinatorial proof of this result is extended to weighted Catalan numbers. In a special case, this settles a conjecture of Postnikov about the number of plane Morse links.