Growth rate of numbers whose prime factors come from a finite set

Reading through Proofs From The Book and came across the assertion that given a set of k primes with k large and ordering the numbers that only have factors from this set, the sequence grows as 2^2^(f(n)) where f(n)/log_2 (n) ≈ 1/k. I'm trying to wrap my head around why.