TITLE: Sequences equidistributed modulo 1
QUESTION [5 upvotes]: Let $\alpha$ be any positive irrational and $\beta$ be any positive real. We have the following results.
H. Weyl (1909): The fractional part of the sequence $\alpha n$ is equidistributed modulo 1.
I. Vinogradov (1935): The fractional part of the sequence $\alpha p_n$ is equidistributed modulo 1 where $p_n$ is the $n$-th prime.
E. Hlawka (1975): The fractional part of the sequence $\beta \gamma_n$ is equidistributed modulo 1 where $\gamma_n$ is the imaginary part of the $n$-th zero the Riemann zeta function.
The common thing in each of the above three celebrated results is that the sequences are of the form $as_n$ where $a$ is a positive real and $s_n$ has the property that the sequence
$$
\frac{s_1}{s_n}, \frac{s_2}{s_n}, \ldots , \frac{s_{n-1}}{s_n}
$$
approaches equidistribution modulo 1 as $n \to \infty$.
Question: I would like a nontrivial counterexample of a positive real $a$ and a sequence $s_n$ such that the fractional part of the sequence $as_n$ is equidistributed modulo 1 but the sequence of the ratios $s_i/s_n$ do not approach equidistribution modulo 1 as $n \to \infty$.  
Edit: I am explaining what I mean by nontrivial because the example given by Noam indicates that it is necessary to explain it explicitly. The examples of Weyl, Vinogradov and Hlawka are nontrivial because there is no assumption on the normality constant. If we take the constant to be normal, we indirectly already assume what we want to prove and so we can construct many artificial examples.

REPLY [3 votes]: Consider all possible pairs $(a,s_n)$ of a positive irrational $a$ and an integer sequence $s_n$  with exponential growth. It seems likely (maybe even easy to show) that it is almost always true that the sequence of fractional parts $[r_n]=\{s_na\}|_{n \in \mathbf{N}}$ is equally distributed in $[0,1).$ For example for any fixed sequence $s_n$ (or even all the sequences $b^n$) the set of appropriate $a$ will have density $1$.
You've already rejected this, but take $s_n=10^{n^{2}}.$ then given a desired sequence $r_n^{'}$ in $[0,1)$ we can easily describe an explicit $a$ such that $|\{s_na\}-r_n^{'}| \lt 10^{1-2n}$ (use the first $2j-1$ digits of $r_j'$ followed by the first $2j+1$ of  $r^{'}_{j+1}$ etc. for $j \ge 1$.)
You will probably be as displeased with this, but I'll mention it anyway: Pick any positive irrational $a$ you wish and any desired sequence $r_n^{'}$ in $[0,1).$ Then we can also pick an integer sequence $s_n$ one term at a time so that for each $n$, $|\{s_na\}-r_n^{'}| \lt 10^{-n}$ and $\frac{s_1}{s_n} \lt \frac{s_2}{s_n} \lt \ldots \lt \frac{s_{n-1}}{s_n} \lt10^{-n}$: Suppose $s_{k-1}$ has been determined and consider in order $s_k=10^ks_{k-1},1+10^ks_{k-1},2+10^ks_{k-1},\cdots  .$ From the theorem of Weyl, you are sure to eventually arrive at a choice   with $\{s_ka\}$ differing from $r^{'}_k$ by no more than $10^{-k}.$