OFFSET
1,1
COMMENTS
All terms == 0 or 2 (mod 6). Those == 0 (mod 6) are 5 + A006512(k) for k > 1. - Robert Israel, May 28 2026
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Goldbach Partition
Wikipedia, Goldbach's conjecture
EXAMPLE
12 is in the sequence since 12 = 7 + 5 (distinct primes), 7 = 5 + 2 (both prime) and 5 = 3 + 2 (both prime).
18 is in the sequence since 18 = 13 + 5 (distinct primes), 13 = 11 + 2 (both prime) and 5 = 3 + 2 (both prime).
MAPLE
N:= 500: # for terms <= N
P:= select(t -> isprime(t) and isprime(t-2), [5, seq(i, i=7..N, 6)]):
sort(convert(select(`<=`, {seq(seq(P[i]+P[j], i=1..j-1), j=1..nops(P))}, N), list)); # Robert Israel, May 28 2026
MATHEMATICA
Table[If[Sum[(PrimePi[i - 2] - PrimePi[i - 3]) (PrimePi[2 n - i - 2] - PrimePi[2 n - i - 3]) (PrimePi[i] - PrimePi[i - 1]) (PrimePi[2 n - i] - PrimePi[2 n - i - 1]), {i, n - 1}] > 0, 2 n, {}], {n, 150}] // Flatten
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
Wesley Ivan Hurt, Apr 16 2020
STATUS
approved
