The usual law of the iterated logarithm states that the partial sums Sn of independent and identically distributed random variables can be normalized by the sequence an = d -, such that limsup,,, &/a, = t/z a. 9.. As has been pointed out by GUT (1986) the law fails if one considers the limsup along subsequences which increase faster than exponentially. In particular, for very rapidly increasing subsequences {nk, k 2 1) one has limsupk-oo S,, /ank = 0 a. 9.. In these cases the normalizing constants ank have to be replaced by J;6;i.pk to obtain a non-trivial limiting behaviour: limsupk4ao S n k / d a = 0 a. 8. . We will present an intelligible argument for this structural change and apply it to related results. lishes the convergence of the mean; $Sn t 0 almost surely (a.s.). The weights 1/n lead to a degenerate limiting law and hence tend to zero too fast. On the other hand, the norming factors l / f i produce the Central Limit Theorem; h S n 3 N(0, l), but S,/J;;; is a. s. diverging. Thus the rate of convergence of the mean S,/n is slower than AMS subject classification: 60F15, 60G50 Key words: Sums of i.i.d. random variables, law of the iterated logarithm, subsequence, geometric increase, Chung's law of the iterated logarithm, Kolmogorov statistic.(in Russian).