cp's OEIS Frontend

A335046 Maximal common prime of two Goldbach partitions of 2n and 2(n+1) or zero (if common prime does not exist).

%I A335046 #8 Jun 20 2020 16:23:32
%S A335046 0,3,5,7,7,11,13,13,17,19,19,23,23,19,29,31,31,0,37,37,41,43,43,47,47,
%T A335046 43,53,53,43,59,61,61,0,67,67,71,73,73,0,79,79,83,83,79,89,89,79,0,97,
%U A335046 97,101,103,103,107,109,109,113,113,109,0,113,109,0,127,127,131,131,127,137,139,139
%N A335046 Maximal common prime of two Goldbach partitions of 2n and 2(n+1) or zero (if common prime does not exist).
%H A335046 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a>
%e A335046 4 = 2+2 and 6 = 3+3. Since those are the only available Goldbach partitions and they have no common prime, a(4/2) = a(2) = 0. 14 = 3+11 and 16 = 5+11, so a(14/2) = a(7) = 11.
%p A335046 S:= proc(n) option remember; {seq((h-> `if`(
%p A335046       andmap(isprime, h), h, [])[])([n+i, n-i]), i=0..n-2)}
%p A335046     end:
%p A335046 a:= n-> max(0, (S(n) intersect S(n+1))[]):
%p A335046 seq(a(n), n=2..80);  # _Alois P. Heinz_, Jun 20 2020
%t A335046 d[n_]:=Flatten[Cases[FrobeniusSolve[{1,1},2*n],{__?PrimeQ}]]
%t A335046 e[n_]:=Intersection[d[n],d[n+1]]; f[n_]:=If[e[n]=={},0,Max[e[n]]];
%t A335046 f/@Range[2,100]
%Y A335046 Cf. A002372, A002373, A002375, A045917, A060308, A335045.
%K A335046 nonn
%O A335046 2,2
%A A335046 _Ivan N. Ianakiev_, May 21 2020