This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014011 Defined by a chi-inequality greedy algorithm. 5
 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 96, 102, 108, 114, 120, 126, 133, 140, 147, 154, 161, 168, 176, 184, 192, 200, 208, 216, 225, 234, 243, 252, 261, 270, 280, 290, 300, 310, 320, 330, 341, 352, 363, 374, 385 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163-166. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 Yong-Gao Chen, On the reciprocal sum of a sum-free sequence, Sci China Math, 2013, 56: 951-966, doi:10.1007/s11425-012-4540-6. Steven R. Finch, A Convex Maximization Problem [Broken link] Steven R. Finch, A convex maximization problem: Discrete case, arXiv:math/9912035 [math.OC], 1999, and Continuous Case. Steven R. Finch, Erdos's Reciprocal Sum Constants [Broken link] Steven R. Finch, Erdos's Reciprocal Sum Constants [From the Wayback machine] E. Levine and J. O'Sullivan, An upper estimate for the reciprocal sum of a sum-free sequence, Acta Arithmetica, 34 (1977), 9-24. Eric Weisstein's World of Mathematics, Levine-O'Sullivan Sequence. FORMULA a(n) = max{(k+1)*(n-a(k)): 1<=k

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 July 17 23:21 EDT 2019. Contains 325109 sequences. (Running on oeis4.)