This sequence is mentioned by this project at this link: PolyMath4. Specifically,
- ..."If one instead works with Sylvester's sequence , then it is known [O1985] that the number of primes less than n that can divide any one of the ak is O(n / lognlogloglogn) rather than O(n / logn) (the prime number theorem bound). If we then factor the first k elements of this sequence, we must get a prime of size at least klogklogloglogk or so...."
--Bill McEachen 14:10, 11 October 2010 (UTC)