This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079937 #18 Aug 31 2025 01:20:53
%S A079937 1,2,14,45,107,138,276,414,1135,2270,6672,12209,18881,180865,361730,
%T A079937 542595,723460,2031679,7945851,15891702,21805874,29751725,43611748,
%U A079937 65417622,87223496,362754007,384559881,406365755
%N A079937 Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.
%C A079937 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.
%e A079937 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.
%Y A079937 Cf. A080017 (denominators of convergents to Pi^2/6), A079934, A079938, A079939.
%K A079937 nonn,more,changed
%O A079937 1,2
%A A079937 _Benoit Cloitre_ and _Paul D. Hanna_, Jan 21 2003
%E A079937 a(15)-a(28) from _Sean A. Irvine_, Aug 30 2025