This site is supported by donations to The OEIS Foundation.



Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130588 Integers which are not the sum of a 3-almost prime and a prime. 4
2, 3, 4, 5, 6, 7, 8, 9, 12, 16, 18, 24, 26, 28, 36, 42, 60, 84, 90, 96, 114, 300 (list; graph; refs; listen; history; text; internal format)



T. D. Noe found no more values up to 10000 and agrees with my conjecture that this sequence is probably finite. This is related to Chen's Theorem: "Every 'large' even number may be written as 2n = p + m where p is a prime and m in A001358 is the set of semiprimes (i.e., 2-almost primes)" which itself is related to Goldbach's conjecture. However, we have no proof, merely the sense that it gets easier and easier to find more and more A014612(i) + A000040(j) = n decompositions as n increases.


Table of n, a(n) for n=2..23.


{n such that for no integers i, j is it the case that A014612(i) + A000040(j) = n}.


n<10 are in this sequence because the smallest 3-almost prime is 8, hence the smallest 3-almost prime plus prime is 10 = 8 + 2. We have that 282 is not in this sequence because 282 = 125 + 157 = A014612(30) + A000040(37).


Cf. A000040, A001358, A014612, A064653.

Sequence in context: A185186 A115569 A064653 * A079238 A079042 A193455

Adjacent sequences:  A130585 A130586 A130587 * A130589 A130590 A130591




Jonathan Vos Post, Jun 16 2007



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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 21:46 EST 2017. Contains 295141 sequences.