Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Nov 22 2016 21:26:26
%S 1,2,3,4,5,7,32,52,55,56,58,61,64,66,72,80,86,88,89,94,101,103,108,
%T 109,128,130,131,161,173,187,193,194,213,214,224,244,253,260,270,292,
%U 304,314,323,334,344,348,349,365,370,373,388,404,424,454,470,478,482
%N Zero terms of A278341
%C It is conjectured that this sequence is finite and all 208 terms are found.
%H Lei Zhou, <a href="/A278342/b278342.txt">Table of n, a(n) for n = 1..208</a>
%e A278341(1,2,3,4,5,7)=0, so a(1)=1, a(2)=2,...,a(5)=5, and a(6)=7.
%e a(7)=32 is because 32 cannot be decomposited into the sum of two terms in A274987={3, 5, 7, 11, 13, 17, 23, 31, 37, 53, 59, 61, 73, 79, 83, 89, 101, 103, 109...}.
%t p = 3; sp = {p}; m = 0; Table[
%t While[m++; l = Length[sp];
%t While[sp[[l]] < m,
%t While[p = NextPrime[p];
%t cp = 2*3^(Floor[Log[3, 2*p - 1]]) - p; ! PrimeQ[cp]];
%t AppendTo[sp, p]; l++]; c = 2 - Mod[m + 1, 2]; ct = 0;
%t Do[If[MemberQ[sp, m - c*sp[[i]]],
%t If[Abs[Floor[Log[3, 2*sp[[i]] - 1]] -
%t Floor[Log[3, 2*(m - c*sp[[i]]) - 1]]] <= 1,
%t If[c == 1, If[(2*sp[[i]]) <= m, ct++], ct++]]], {i, 1, l}];
%t ct > 0];
%t m, {n, 1, 208}]
%Y Cf. A278341, A274987.
%K nonn,fini,full
%O 1,2
%A _Lei Zhou_, Nov 18 2016