A279040 -id:A279040 - cp's OEIS frontend

A307542 Even integers k such that there exists a prime p with p = min{q: q prime and (k - q) prime} and (k - p) < p^2.

4, 6, 8, 10, 12, 18, 24, 28, 30, 38, 54, 98, 122, 124, 126, 128, 220, 302, 308, 332, 346, 368, 488, 556, 854, 908, 962, 968, 992, 1144, 1150, 1274, 1354, 1360, 1362, 1382, 1408, 1424, 1532, 1768, 1856, 1928, 2078, 2188, 2200, 2438, 2512, 2530, 2618, 2642, 3458, 3526, 3818, 3848

Offset: 1

Corinna Regina Böger, Apr 14 2019

nonn

This sequence is an extension of A244408. It is equivalent to "Even numbers 2n such that the smallest prime p satisfying p+q=2n (p, q prime, p<=q) also satisfies p^2+p>2n." If p satisfies additionally p^2 < 2n the corresponding even numbers do not belong to A244408. These numbers are 10, 28, 54, 124, 368, 968, 3526. It is conjectured that a(81)=63274 is the last term. There are no more terms below 4*10^18.

			10 = 3 + 7, 3^2 = 9 < 10 and 9 > 7 = q, therefore it is in this sequence.

Corinna Regina Böger, Table of n, a(n) for n = 1..81

Cf. A244408, A093161, A279040.

isS := proc(n) local p; for p from 2 while p^2 < (n-p) do
if isprime(p) and isprime(n-p) then return false fi od; true end:
isa := n -> irem(n, 2) = 0 and isS(n): select(isa, [$4..3848]); # Peter Luschny, Apr 26 2019

Select[Range[4, 4000, 2], #2 > Sqrt@ #1 & @@ SelectFirst[IntegerPartitions[#, {2}], AllTrue[#, PrimeQ] &] &] (* Michael De Vlieger, Apr 21 2019 *)

noSpecialGoldbach(n) = forprime(p=2, n/2, if(p^2+p2 && n%2 == 0 && noSpecialGoldbach(n)

A307782 Even integers k such that there exists a prime p with p=min{q: q prime and (k-q) prime} and k < p^3.

Original entry on oeis.org

4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 36, 38, 42, 48, 52, 54, 58, 60, 66, 68, 72, 78, 80, 84, 88, 90, 94, 96, 98, 102, 108, 114, 118, 120, 122, 124, 126, 128, 138, 146, 148, 150, 158, 164, 174, 180, 188, 190, 192, 206, 208, 210, 212, 218, 220, 222, 224, 240, 248, 250, 252, 258, 264, 270, 278, 290, 292, 294, 300, 302, 304, 306, 308, 324, 326, 328, 330, 332, 338, 346

Offset: 1

Corinna Regina Böger, Apr 28 2019

nonn

[Please keep the larger data section as it shows where the sequence first differs from A093161.]
This is another member of a family of sequences concerning the Strong Goldbach Conjecture, which I define as follows: Let (x, y, z) be real numbers with x >= 2, y > 0, z >= 0. An even integer k is then called an (x, y, z) Extraordinary Goldbach Number (EGN) if there exists a prime p with p=min{q: q prime and (k-q) prime} and (k - z*p) < y*p^x. a(n) represents the (3, 1, 0) extraordinary Goldbach numbers. A093161 consists of (3, 1, 1) EGN, A307542 are the (2, 1, 1) EGN, A279040 are the (2, 2, 0) EGN and A244408 are the (2, 1, 0).
a(104809) is very probably the last term and there are no more terms below 4*10^18.
There are only 11 terms in A093161 that are not in this sequence; these are 344, 1338, 12184, 12186, 24400, 148912, 1030342, 2571406, 3308008, 5929868, 15813352.

			344 is not in the sequence, because the smallest prime p for 344 is 7 with 7^3 = 343 < 344, whereas it is in A093161 due to 344 - 7 = 337 < 7^3.

Corinna Regina Böger, Table of n, a(n) for n = 1..10000
Corinna Regina Böger, a-file, Table of n, a(n) for n = 1..104809

Cf. A093161, A244408, A279040, A307542.

extraordinaryGoldbach(x,y,z,k) = forprime(p=2, k/2, if(isprime(k-p), if(y*p^x+z*p>=k, return(1),return(0)))); 0
is(n) = n%2 == 0 && extraordinaryGoldbach(3, 1, 0, n)

A273457 Even numbers 2n that do not have a Goldbach partition 2n = p + q (p < q; p, q prime) satisfying sqrt(n) < p <= sqrt(2n).

Original entry on oeis.org

2, 4, 6, 8, 12, 18, 20, 22, 24, 26, 30, 32, 38, 40, 44, 52, 56, 58, 62, 64, 70, 72, 76, 82, 84, 88, 92, 94, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 126, 128, 130, 132, 134, 136, 140, 144, 146, 152, 154, 156, 158, 164, 166, 172, 182, 188, 196, 198, 200, 214

Offset: 1

Corinna Regina Böger, Dec 11 2016

nonn

This is an extension of A244408.
There are 74 elements of A279040 that are also in this sequence. These common elements are in A244408.
It is conjectured that a(12831) = 15702604 is the last term. There are no more terms below 4*10^10.

			32 is in the sequence because 32 has two Goldbach partitions: 32 = 3 + 29 with 3 < sqrt(16) and 32 = 13 + 19 with 13 > sqrt(32).

Corinna Regina Böger, Table of n, a(n) for n = 1..12831

Cf. A002373, A020481, A025018, A025019, A244408, A279040.

noGoldbatSqrQ[n_] := Block[{p = NextPrime[Sqrt[n/2]]}, While[2p < n && !PrimeQ[n - p], p = NextPrime@ p]; p > Sqrt[n]]; noGoldbatSqrQ[4] = True; Select[2Range[107], noGoldbatSqrQ] (* Robert G. Wilson v, Dec 15 2016 *)

noSpecialGoldbach(n) = forprime(p=sqrtint(n/2-1) + 1, sqrtint(n), if(p<(n-p) && isprime(n-p), return(0))); 1
is(n) = n%2 == 0 && noSpecialGoldbach(n)

A274189 Even numbers 2n that satisfy an extended Goldbach conjecture: They have at least one Goldbach partition 2n = p + q (p <= q; p, q prime) that satisfies p <= sqrt(n), at least one with sqrt(n) < p <= sqrt(2n) and at least one with p > sqrt(2n).

Original entry on oeis.org

34, 46, 50, 66, 74, 78, 86, 138, 142, 160, 162, 168, 170, 174, 176, 178, 180, 184, 186, 194, 202, 204, 206, 234, 236, 238, 240, 242, 246, 252, 254, 264, 270, 276, 282, 284, 290, 294, 296, 298, 300, 310, 320, 324, 328, 334, 348, 354, 364, 366, 370, 372, 376, 378, 384, 386, 390, 392, 396, 400

Offset: 1

Corinna Regina Böger, Dec 11 2016

nonn

This sequence contains all even numbers that are not in A279040 or in A273457. I have verified numerically for all even numbers 4 < 2n < 4*10^10 that a Goldbach partition with the additional condition p > sqrt(2n) exists. It is conjectured that a(n) = 2*(n+12987) for all n > 7838315. If this conjecture is true, all even numbers 2n > 15702604 have all three types of Goldbach partitions and therefore satisfy the "extended Goldbach conjecture".

			a(1) = 34 = 3 + 31 = 5 + 29 = 11 + 23 = 17 + 17. Since 3 < sqrt(17) < 5 < sqrt(34) < 11 < 17, all three types of Goldbach partitions exist for 34.

Corinna Regina Böger, Table of n, a(n) for n = 1..100000
Index entries for sequences related to Goldbach conjecture

Cf. A002373, A020481, A025018, A025019, A244408, A273457, A279040.

GoldbachRange(n,mn,mx)=forprime(p=mn,mx, if(isprime(n-p), return(1))); 0
is(n)=n%2==0 && GoldbachRange(n, 2, sqrtint(n/2)) && GoldbachRange(n, sqrtint(n/2-1)+1, sqrtint(n)) && GoldbachRange(n, sqrtint(n-1)+1, n/2) \\ Charles R Greathouse IV, Dec 16 2016

A283555 Even numbers that cannot be expressed as p+3, p+5, or p+7, with p prime.

Original entry on oeis.org

98, 122, 124, 126, 128, 148, 150, 190, 192, 208, 210, 212, 220, 222, 224, 250, 252, 292, 294, 302, 304, 306, 308, 326, 328, 330, 332, 346, 348, 368, 398, 410, 418, 420, 430, 432, 458, 476, 478, 480, 488, 500, 518, 520, 522, 532, 534, 536, 538, 540, 542, 556

Offset: 1

Keith Backman, Mar 10 2017

nonn

Any even number 2n which fails the Goldbach condition (i.e., is not expressible as the sum of two primes) cannot be a prime plus 3 (by definition), but it must also be the case that the two even numbers immediately smaller than 2n (i.e., 2n-2 and 2n-4) also cannot be a prime plus 3, because if they were, 2n would be a prime plus 5 or a prime plus 7 and would satisfy Goldbach. Thus any even number which fails the Goldbach condition must fall in this sequence. Note: none of the given members of the sequence fails Goldbach.

Cf. A279040.

Select[2 Range[400], ! Or @@ PrimeQ[# - {3, 5, 7}] &] (* Giovanni Resta, Mar 10 2017 *)

cp's OEIS Frontend

A307542 Even integers k such that there exists a prime p with p = min{q: q prime and (k - q) prime} and (k - p) < p^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A307782 Even integers k such that there exists a prime p with p=min{q: q prime and (k-q) prime} and k < p^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A273457 Even numbers 2n that do not have a Goldbach partition 2n = p + q (p < q; p, q prime) satisfying sqrt(n) < p <= sqrt(2n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A274189 Even numbers 2n that satisfy an extended Goldbach conjecture: They have at least one Goldbach partition 2n = p + q (p <= q; p, q prime) that satisfies p <= sqrt(n), at least one with sqrt(n) < p <= sqrt(2n) and at least one with p > sqrt(2n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A283555 Even numbers that cannot be expressed as p+3, p+5, or p+7, with p prime.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica