OFFSET
1,2
COMMENTS
Equivalently, prime(k+1) / prime(k) < 2^(1/n). The case n = 2 is proved by Dressler et al.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
Robert E. Dressler, Louis Pigno, and Robert Young, Sums of squares of primes, Nordisk Mat. Tidskr. 24 (1976), 39-40.
MATHEMATICA
Table[t = Table[(Prime[i+1]/Prime[i])^n, {i, 20*n}]; pos = Position[t, _?(# > 2 &)]; If[pos == {}, 1, pos[[-1, 1]] + 1], {n, 60}]
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Jul 11 2012
STATUS
approved