login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051741 Associated with a chi-inequality greedy algorithm. 2
4, 10, 14, 24, 30, 36, 42, 48, 54, 72, 80, 88, 96, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 246, 258, 270, 282, 294, 306, 350, 364, 378, 392, 406, 420, 472, 488, 504, 520, 536, 552, 612, 630, 648, 666, 684, 702, 770, 790, 810, 830, 850, 870, 946, 968 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163-166.
LINKS
S. R. Finch, A Convex Maximization Problem [Broken link]
Steven R. Finch, A convex maximization problem: Discrete case, arXiv:math/9912035 [math.OC], 1999.
Steven R. Finch, A convex maximization problem: Continuous Case, arXiv:math/9912036 [math.OC], 1999.
Steven R. Finch, Erdos's Reciprocal Sum Constants [Broken link]
Steven R. Finch, Erdos's Reciprocal Sum Constants [From the Wayback machine]
FORMULA
a(n) = (n+2) * A014011(n+1) - (n+1) * A014011(n). - Sean A. Irvine, Oct 04 2021
CROSSREFS
Sequence in context: A242486 A060031 A112825 * A022382 A162521 A125302
KEYWORD
nonn
AUTHOR
Steven Finch, Dec 07 1999
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 15 02:01 EDT 2024. Contains 371667 sequences. (Running on oeis4.)