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!)
A086505 a(n) is the n-th smallest prime p such that p+2n is also prime. 4

%I #18 Aug 07 2014 04:25:03

%S 3,7,11,23,31,29,53,73,53,89,157,73,137,199,73,281,229,127,383,229,

%T 149,389,463,193,359,547,239,467,823,197,857,883,283,809,499,389,1013,

%U 907,421,827,1201,373,1151,1231,367,1307,1279,577,1229,1009,631,1427,1783

%N a(n) is the n-th smallest prime p such that p+2n is also prime.

%C Note the patterns in the graph. These patterns depend on the number of prime factors of n: see color graph for different n's: n primes - black dots, n multiples of 3 - red dots, n multiples of 15 - green dots, n multiples of 105 - blue dots. - _Zak Seidov_, Nov 28 2013

%H Zak Seidov, <a href="/A086505/b086505.txt">Table of n, a(n) for n = 1..10000</a>

%H Zak Seidov, <a href="/A086505/a086505.jpg">Color graph for different n's</a>

%p N:= 10^4: # to get all terms before the first with a(n)+2*n > N

%p Primes:= select(isprime, {seq(2*i+1, i=1..N)}):

%p for n from 1 do

%p R:= Primes intersect map(`+`, Primes, -2*n);

%p if nops(R) < n then break fi;

%p A[n]:= R[n];

%p od:

%p seq(A[j],j=1..n-1); # _Robert Israel_, Aug 07 2014

%Y Cf. A020483, A231608.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Jul 29 2003

%E Edited by _Sam Alexander_, Feb 26 2004

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 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)