Problem 3621 · Hard

Number of Integers With Popcount-Depth Equal to K I

Depth of x is one more than the depth of its popcount, so count the numbers up to n by popcount with binomial coefficients.

Open the interactive visualisation