This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A188430 U(n) is the maximum of the largest elements of all n-full sets, or 0 if no such set exists. 3
 1, 0, 2, 0, 0, 3, 4, 0, 0, 4, 5, 6, 7, 7, 8, 6, 7, 8, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 38 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Let A be a set of positive integers. We say that A is n-full if (sum A)=[n] for a positive integer n, where (sum A) is the set of all positive integers which are a sum of distinct elements of A and [n]={1,2,...,n}. The number U(n) denotes the maximum of the set {max A: (sum A)=[n]}, or 0 if there is no n-full set. LINKS L. Naranjani and M. Mirzavaziri, Full Subsets of N, Journal of Integer Sequences, 14 (2011), Article 11.5.3. FORMULA U(n) is the ceiling of n/2 for n>=20. PROG (Haskell) a188430 n = a188430_list !! (n-1) a188430_list = [1, 0, 2, 0, 0, 3, 4, 0, 0, 4, 5, 6, 7, 7, 8, 6, 7, 8, 9] ++                (drop 19 a008619_list) -- Reinhard Zumkeller, Aug 06 2015 CROSSREFS Cf. A188429, A188431. Cf. A008619. Sequence in context: A174956 A124182 A188429 * A013585 A261319 A230414 Adjacent sequences:  A188427 A188428 A188429 * A188431 A188432 A188433 KEYWORD nonn AUTHOR Madjid Mirzavaziri, Mar 31 2011 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 December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)