If you count for each $k \geq 1$ the number of integers $n$ such that $k = \lceil log_2(n) \rceil$, the sequence generated would be $1, 1, 2, 3, 5, 7, 13, 16, 24, 33, 47, 60...$. Such numbers $n$ are all odd and mostly prime (probably for obvious reasons, that's how $\phi$ works). Searching the sequence above up on OEIS returned one 1-1 match which was very interesting to me until I looked at the definition of the sequence (it was created specifically because of this problem). Still, interesting blog, and made me remember my number theory.
If you count for each $k \geq 1$ the number of integers $n$ such that $k = \lceil log_2(n) \rceil$, the sequence generated would be $1, 1, 2, 3, 5, 7, 13, 16, 24, 33, 47, 60...$. Such numbers $n$ are all odd and mostly prime (probably for obvious reasons, that's how $\phi$ works). Searching the sequence above up on OEIS returned one 1-1 match which was very interesting to me until I looked at the definition of the sequence (it was created specifically because of this problem). Still, interesting blog, and made me remember my number theory.