login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A173937 Smallest natural d = d(n) such that 2^n + d is lesser of twin primes (n = 0, 1, 2, ...). 6

%I #12 May 23 2013 20:06:05

%S 2,1,1,3,1,9,7,9,13,9,7,33,31,27,67,33,1,39,7,63,313,105,277,9,73,69,

%T 457,51,121,105,7,219,91,297,247,321,115,567,1327,411,553,987,325,183,

%U 2065,2565,415,879,241,459,643,1209,391,1155,1477,1449,175,129,1045

%N Smallest natural d = d(n) such that 2^n + d is lesser of twin primes (n = 0, 1, 2, ...).

%D Richard K. Guy, Unsolved Problems in Number Theory, New York, Springer-Verlag, 1994

%D Friedhelm Padberg, Elementare Zahlentheorie, Spektrum Akademischer Verlag, Berlin Heidelberg, 1996

%D Daniel Shanks, Solved and Unsolved Problems in Number Theory, 4th ed., New York, Chelsea, 1993

%H T. D. Noe, <a href="/A173937/b173937.txt">Table of n, a(n) for n = 0..300</a>

%H Ken Takusagawa, <a href="http://www.mit.edu/~kenta/three/prime/a.html">Twin primes</a>

%e 2^0 + 2 = 3 = prime(2), 2^0 + 4 = 5 = prime(3).

%e 2^1 + 1 = 3 = prime(2), 2^1 + 3 = 5 = prime(3).

%e 2^2 + 1 = 5 = prime(3), 2^2 + 3 = 7 = prime(4).

%t Join[{2}, Table[s = 2^n + 1; While[! (PrimeQ[s] && PrimeQ[s + 2]), s = s + 2]; s - 2^n, {n, 60}]] (* _T. D. Noe_, May 08 2012 *)

%o (PARI) A173937(n)={forstep(p=2^n\6*6+5,2<<n,6,isprime(p)||next; isprime(p+2)&return(p-2^n)); 2-n} \\ _M. F. Hasler_, Oct 21 2012

%Y Cf. A001359, A006512, A208572 (smallest twin prime > 2^n).

%K nonn

%O 0,1

%A Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), Mar 03 2010

%E Values a(0..300) double-checked by _M. F. Hasler_, Oct 21 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)