A079941 Greedy frac multiples of log(2): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=log(2).

1, 3, 6, 13, 26, 39, 277, 642, 2291, 4582, 6231, 16402, 26573, 36744, 63317, 73488, 110232, 414355, 828710

Offset

1,2

Comments

The n-th greedy frac multiple of x is the smallest integer that does not cause sum(k=1..n,frac(a(k)*x)) to exceed unity; an infinite number of terms appear as the denominators of the convergents to the continued fraction of x.

Links

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

Example

a(4) = 13 since frac(1x) + frac(3x) + frac(6x) + frac(13x) < 1, while frac(1x) + frac(3x) + frac(6x) + frac(k*x) > 1 for all k>6 and k<13.

Crossrefs

Cf. A079943 (denominators of convergents to ln2), A079934, A079939, A079940.

Sequence in context: A074890 A244704 A032198 * A255125 A267367 A265385

Adjacent sequences: A079938 A079939 A079940 * A079942 A079943 A079944

Keyword

nonn

Author

Benoit Cloitre and Paul D. Hanna, Jan 21 2003

Extensions

More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Jan 29 2003

Status

approved