The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187749 Maximum k for which a partition of the product of the first k primes (the k-th primorial) into the sum of two products gives a sum that yields only n composites from that sum down to 1+1=2 by sequential deletion of the largest prime. 3
17, 20, 24, 27, 31, 33, 35, 40, 41, 42, 44, 49, 50, 54 (list; graph; refs; listen; history; text; internal format)



This is an extension of the solution of the maximum problem given at the beginning of the EXAMPLE section.

Counts of the number of ways the n-th primorial can be partitioned into two parts and summed to achieve a maximum number of primes (minimum number of composites), by a variant of the (main) linked program: 2, 5, 1, 3, 3, 2, 4, 1, 2, 7, 7, 1, 2 and 1. This program -- the longer of the ones actually linked to -- produces terms starting at a(1). a(0) is handled fully in the example. An auxiliary program also at the link gives the unique a(13) case in a decompression. - James G. Merickel, Aug 01 2015


Table of n, a(n) for n=0..13.

James G. Merickel, PARI programs 1) for terms beyond a(0) and 2) for a(13) decompression (an auxiliary program)


a(0): Both 2*5*11*23*37*41*43*59 + 3*7*13*17*19*29*31*47*53 and 2*3*5*11*13*19*29*41*43*47*53 + 7*17*23*31*37*59 are primes such that repeatedly removing the largest prime down to the sum 1 + 1 yields a prime, and these are the only examples for the primes through prime(17)=59. That is, for either of the above cases, neither portion may be multiplied by 61 to give a prime sum. Therefore, a(0) = 17, and this means -- identically -- that none of the primes counted in A103787(18) naturally link by deletion to primes counted in A103787(k) in a chain from k equals 17 down to 1, but that at least one of the primes counted in A103787(17) -- both of the above -- do link in such a way to primes counted in A103787(k) for k equals 16 down to 1.

a(2): 2*3*5*11*13*19*29*41*43*47*53*59*71*79*89 + 7*17*23*31*37*61*67*73*83 is prime and removing the primes sequentially yields a composite only after removal of 79 and then of 61. This twosome of composites is uniquely fewest for partitions of this many of the first primes (24), and no such sum that includes the next prime (97) yields fewer than 3 composites by deletion. So, a(2) = 24.


Cf. A019565, A103787.

Sequence in context: A134539 A196571 A031169 * A034069 A340046 A116037

Adjacent sequences:  A187746 A187747 A187748 * A187750 A187751 A187752




James G. Merickel, Jan 03 2013


Program expanded and moved to link by James G. Merickel, Aug 01 2015



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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 21:52 EDT 2021. Contains 348095 sequences. (Running on oeis4.)