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 A079941 #13 Aug 31 2025 21:39:58
%S A079941 1,3,6,13,26,39,277,642,2291,4582,6231,16402,26573,36744,63317,73488,
%T A079941 110232,414355,828710,1206321,2412642,4410929,5617250,12026466,
%U A079941 31668469,51310472,70952475,141904950,394046381
%N A079941 Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.
%C A079941 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 A079941 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.
%Y A079941 Cf. A079943 (denominators of convergents to ln2), A079934, A079939, A079940.
%K A079941 nonn,more,changed
%O A079941 1,2
%A A079941 _Benoit Cloitre_ and _Paul D. Hanna_, Jan 21 2003
%E A079941 More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Jan 29 2003
%E A079941 a(20)-a(29) from _Sean A. Irvine_, Aug 31 2025