login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079941 Greedy frac multiples of log(2): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=log(2). 6
1, 3, 6, 13, 26, 39, 277, 642, 2291, 4582, 6231, 16402, 26573, 36744, 63317, 73488, 110232, 414355, 828710 (list; graph; refs; listen; history; text; internal format)
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 01:20 EST 2018. Contains 317279 sequences. (Running on oeis4.)