A051742 Associated with a chi-inequality greedy algorithm.

1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12

Offset

1,4

References

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

Links

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

Steven 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) = j for A051741(j-1) <= n < A051741(j), with A051741(0)=0. - Sean A. Irvine, Oct 04 2021

Crossrefs

Cf. A014011, A051741.

Sequence in context: A357899 A247781 A004052 * A134119 A064661 A226982

Adjacent sequences: A051739 A051740 A051741 * A051743 A051744 A051745

Keyword

nonn

Author

Steven Finch, Dec 07 1999

Status

approved