login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335360 Numbers m such that the number of unordered Goldbach partitions of 2m is greater than the number of unordered Goldbach partitions of 4m. 0

%I #16 Jun 08 2020 17:34:51

%S 17,32,38,143,353

%N Numbers m such that the number of unordered Goldbach partitions of 2m is greater than the number of unordered Goldbach partitions of 4m.

%C Integers m such that A002375(2*m) > A002375(4*m) .

%C It is conjectured that a(5)=353 is the last term in this sequence.

%H <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a>

%e For a(1)=17, 2*17=34 has 4 Goldbach partitions and 4*17=68 has 2.

%o (PARI) for(n=1, 1000, x=0; y=0; forprime(i=2, 2*n, if(i<=n && isprime(2*n-i), x=x+1; ); if(isprime(4*n-i), y=y+1; ); ); if(x>y, print1(n, ", ")))

%Y Cf. A002375.

%K nonn,more

%O 1,1

%A _Craig J. Beisel_, Jun 03 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 10:23 EDT 2024. Contains 375932 sequences. (Running on oeis4.)