A079937 Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.

1, 2, 14, 45, 107, 138, 276, 414, 1135, 2270, 6672, 12209, 18881, 180865

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

Author

Benoit Cloitre and Paul D. Hanna, Jan 21 2003

Status

approved