Search: id:A062529
Results 1-1 of 1 results found.

%I A062529
%S A062529 2,3,7,89,1831,5591,89689,3851459,1872851947,1999066711391,22790428875364879
%N A062529 Smallest prime p such that there is a gap of 2^n between p and the next 
               prime.
%C A062529 a(2)=7 because 7 and 11 are consecutive primes with difference 4.
%H A062529 C. Hilliard, <a href="http://groups.msn.com/NthprimeAlgorithms/twinprimesjava.msnw">
               TwinPrimes Java code</a>.
%H A062529 Thomas R. Nicely, <a href="http://www.trnicely.net/gaps/gaplist.html">
               First occurrence prime gaps</a>.
%F A062529 a(n)=A000230[2^(n-1)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Jan 12 2007
%F A062529 a(n) = A000230[2^(n-1)] = Min{p|nextprime(p)-p = 2^n} [May need adjusting 
               since offset has been changed]
%e A062529 p=89, 89+2^3 = 97, prime
%t A062529 f[n_] := Block[{k = 1}, While[Prime[k + 1] != n + Prime[k], k++ ]; Prime[k]]; 
               Do[ Print[ f[2^n]], {n, 0, 10}] (Robert G. Wilson v, Jan 13 2005)
%Y A062529 Cf. A000230, A062530, A101232.
%Y A062529 Sequence in context: A065002 A053964 A062578 this_sequence A058443 A163152 
               A088120
%Y A062529 Adjacent sequences: A062526 A062527 A062528 this_sequence A062530 A062531 
               A062532
%K A062529 nonn
%O A062529 0,1
%A A062529 Labos E. (labos(AT)ana.sote.hu), Jun 25 2001
%E A062529 a(10) sent by Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 13 2005

Search completed in 0.001 seconds