The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283371 Maximum number of pairs of primes (p, q) such that p < q = < prime (n) and q - p = constant. 2

%I

%S 0,1,1,2,2,3,3,4,5,6,6,7,7,8,9,10,11,11,12,12,13,14,14,15,15,15,16,17,

%T 18,19,19,19,20,21,21,21,22,22,23,23,24,25,25,26,27,27,28,29,30,31,31,

%U 31,32,32,33,34,35,36,36,37,37,38,39,40,41,41,41,42,43,43,43,43,44,44,45,46,47,48,48,49,50,50

%N Maximum number of pairs of primes (p, q) such that p < q = < prime (n) and q - p = constant.

%C Maximum number of different ways of expressing a positive number as a difference of two distinct primes less than or equal to prime(n).

%C Is there any n such that a(n+1) - a(n) > 1?

%C What is the asymptotic behavior of a(n)?

%C To answer the first question: for all n, either a(n+1) = a(n) or a(n+1) = a(n) + 1. - _Charles R Greathouse IV_, Mar 06 2017

%H Charles R Greathouse IV, <a href="/A283371/b283371.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) >> n/log n. In particular, lim inf a(n) * (log n)/n >= 1/2. - _Charles R Greathouse IV_, Mar 06 2017

%e a(1)=0 because there are no two distinct primes less than or equal to prime(1)=2.

%e a(2)=1 because there are only two distinct primes less than or equal to prime(2)=3, and then there is only one positive difference among them: 3 - 2 = 1.

%e a(3)=1 because the three pairs of distinct primes less than or equal to prime(3)=5, i.e., (2,3), (3,5), and (2,5), produce different positive differences: 3 - 2 = 1, 5 - 3 = 2, and 5 - 2 = 3.

%e a(4)=2 because among all pairs of distinct primes taken from the first four primes, 2, 3, 5, and 7, there are two pairs with same positive difference, i.e., 7 - 5 = 5 - 3 = 2.

%e a(6)=3 because among all pairs of distinct primes taken from the first six primes, 2, 3, 5, 7, 11, and 13, there are at most three pairs with the same positive difference, i.e., 13 - 11 = 7 - 5 = 5 - 3 = 2.

%t a[n_]:=Module[{fp,fps,fpst,fpstts,fpsttst},

%t fp=Prime[Range[n]];

%t fps=Subsets[fp,{2}];

%t fpst=Table[Abs@(fps[[j]][]-fps[[j]][]),{j,1,Length[fps]}];

%t fpstts=fpst//Tally;

%t If[n<2,0,fpsttst=fpstts//Transpose;fpsttst[]//Max]//Return];

%t Table[a[n],{n,1,120}]

%o (PARI) first(n)=my(v=vector(n),P=primes(n),H=vectorsmall((P[#P]-P)/2,i,0)); v=1; for(n=3,#P, for(i=2,n-1,H[(P[n]-P[i])/2]++); v[n]=vecmax(H)); v \\ _Charles R Greathouse IV_, Mar 06 2017

%Y Cf. A283302, A030173.

%K nonn

%O 1,4

%A _Andres Cicuttin_, Mar 06 2017

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

Last modified October 25 20:31 EDT 2021. Contains 348256 sequences. (Running on oeis4.)