cp's OEIS Frontend

A066286 For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.

%I A066286 #25 Jul 03 2025 18:52:58
%S A066286 0,2,6,18,30,36,42,54,66,78,84,90,96,150,174,186,234,240,270,276,336,
%T A066286 366,420,456,600,666,738,786,906,1050,1242,1440,1620,1692,2172,2562,
%U A066286 2610,3030,3180,3234,3444,3588,3666,3702,4020,4128,4170,4224,4434,4704,5508,5568,6678,6858,8790,8976,10782
%N A066286 For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.
%C A066286 All terms appear to be divisible by 6, except for the first two.
%H A066286 Robert G. Wilson v, <a href="/A066286/b066286.txt">Table of n, a(n) for n = 0..61</a> (terms 51..55 and 57 from Gilmar Rodriguez)
%t A066286 f[n_] := For[p=n/2, True, p--, If[PrimeQ[p]&&PrimeQ[n-p], Return[n-2p]]]; For[n=4; max=-1, True, n+=2, If[f[n]>max, Print[max=f[n]]]]
%Y A066286 The corresponding values of n are in A065978.
%K A066286 nonn
%O A066286 0,2
%A A066286 _Dean Hickerson_, Dec 12 2001
%E A066286 a(51)-a(55) from Gilmar Rodriguez (Gilmar.Rodriguez(AT)nwfwmd.state.fl.us), Jun 16 2005
%E A066286 a(56) from _Robert G. Wilson v_, Jun 27 2005