login
This site is supported by donations to The OEIS 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>0,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; 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.

EXAMPLE

a(4) = 45 since frac(1x) + frac(2x) + frac(14x) + frac(45x) < 1, while frac(1x) + frac(2x) + frac(14x) + 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: A091405 A085929 A036659 * A197885 A200193 A083102

Adjacent sequences:  A079934 A079935 A079936 * A079938 A079939 A079940

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr) and Paul D. Hanna (pauldhanna(AT)juno.com), Jan 21 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:43 EST 2012. Contains 205904 sequences.