login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079937 Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6. 5
1, 2, 14, 45, 107, 138, 276, 414, 1135, 2270, 6672, 12209, 18881, 180865 (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..14.

EXAMPLE

a(4) = 45 since frac(1*x) + frac(2*x) + frac(14*x) + frac(45*x) < 1, while frac(1*x) + frac(2*x) + frac(14*x) + frac(k*x) > 1 for all k > 14 and k < 45.

CROSSREFS

Cf. A080017 (denominators of convergents to Pi^2/6), A079934, A079938, A079939.

Sequence in context: A231247 A318764 A036659 * A324915 A281760 A197885

Adjacent sequences:  A079934 A079935 A079936 * A079938 A079939 A079940

KEYWORD

nonn,more,changed

AUTHOR

Benoit Cloitre and Paul D. Hanna, Jan 21 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:42 EDT 2021. Contains 343199 sequences. (Running on oeis4.)