A051741 Associated with a chi-inequality greedy algorithm.

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

Offset

1,1

References

Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 163-166.

Links

Table of n, a(n) for n=1..55.

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

Cf. A014011, A051742.

Sequence in context: A242486 A060031 A112825 * A022382 A162521 A125302

Adjacent sequences: A051738 A051739 A051740 * A051742 A051743 A051744

Keyword

nonn

Author

Steven Finch, Dec 07 1999

Status

approved