OFFSET
1,1
COMMENTS
Conjecture: There will always be an x such that a(x+1) - a(x) = k for k=1,2.. However, x becomes large when k > 70.
FORMULA
Prime(x) = the x-th prime. Pi(x) = number of primes <= x.
PROG
(PARI) primexmpix2(n) = \ Get first occurrence { local(x, y, z, c=0); for(k=1, 70, for(x=1, n, y=prime(x)-primepi(x); z=prime(x+1)-primepi(x+1); if(z-y == k, print1(y", "); c++;; break; ) ) ); print(); print(c) }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Oct 22 2005
STATUS
approved