OFFSET
0,10
COMMENTS
For an integer n >= 0 we say a prime p is gb-associated with n if sqrt(n) < p <= n/2 and no prime q which is <= sqrt(n) divides p*(p - n). Let GB(n) be the set of integers which are gb-associated with n (for examples see A338777). a(n) is the number of primes which are gb-associated with n.
If a(n) > 0 for n >= 3 then Goldbach's conjecture is true.
LINKS
Peter Luschny, Table of n, a(n) for n = 0..1000
EXAMPLE
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Nov 08 2020
STATUS
approved