This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216049 Consider the ordered Goldbach partitions of the even numbers m. Then a(n) is the least m which contains 2n-1 such partitions composed of odd primes. 1
 6, 10, 22, 34, 74, 106, 178, 142, 202, 358, 274, 386, 466, 514, 502, 802, 622, 746, 694, 914, 1322, 958, 1094, 1198, 1234, 1282, 1366, 1814, 1762, 1546, 1654, 1618, 1882, 2066, 1954, 2578, 2402, 2374, 2458, 2446, 2554, 2722, 3194, 2986, 2894, 2998, 2902, 3098 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A002372(a(n)/2) = 2n-1. LINKS J. Stauduhar, Table of n, a(n) for n = 1..100 EXAMPLE a(1) = 6, because 6 = {3+3} is the least m to contain one such partition. a(2) = 10, because 10 = {3+7, 5+5, 7+3} is the least m to contain three such partitions. a(3) = 22, because 22 = {3+19, 5+17, 11+11, 17+5, 19+3} is the least m to contain five such partitions. MATHEMATICA For[ls1=ls2={}; ct1=n=1, n<=1000, n++, For[ct2=0; i=1, i<=2n-1, i++, If[OddQ[i] && PrimeQ[i] && PrimeQ[2n-i], ct2++]]; AppendTo[ls1, ct2]; While[(pos=Position[ls1, ct1, 1, 1])!={}, AppendTo[ls2, 2*pos[[1, 1]]]; ct1+=2; ]]; ls2 (* J. Stauduhar, Sep 04 2012 *) CROSSREFS Cf. A002372. Sequence in context: A082917 A001172 A108605 * A063765 A085712 A179875 Adjacent sequences:  A216046 A216047 A216048 * A216050 A216051 A216052 KEYWORD nonn AUTHOR J. Stauduhar, Sep 04 2012 STATUS approved

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.

Last modified October 17 21:37 EDT 2019. Contains 328134 sequences. (Running on oeis4.)