Maximal sparsity of down steps in an hypothetic ever-growing sequence

General
2

In the end anyway, I get that if a sequence starts with X you are guaranteed to observe at least T down steps if you look for at least log2(X)(1+log2(3/2))^T steps