cp's OEIS Frontend

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.

A185050 Least k such that G(k) > 3 - 1/2^n, where G(k) is the sum of the first k terms of the geometric series 1 + 2/3 + (2/3)^2 + ....

This page as a plain text file.
%I A185050 #16 Feb 16 2025 08:33:13
%S A185050 3,5,7,8,10,12,13,15,17,19,20,22,24,25,27,29,31,32,34,36,37,39,41,43,
%T A185050 44,46,48,49,51,53,54,56,58,60,61,63,65,66,68,70,72,73,75,77,78,80,82,
%U A185050 84,85,87,89,90,92,94,96,97,99,101,102,104,106,107,109,111,113
%N A185050 Least k such that G(k) > 3 - 1/2^n, where G(k) is the sum of the first k terms of the geometric series 1 + 2/3 + (2/3)^2 + ....
%C A185050 Many of terms in this sequence are that same as A186219(n+2) but not all.
%D A185050 Mohammad K. Azarian, Geometric Series, Problem 329, Mathematics and Computer Education, Vol. 30, No. 1, Winter 1996, p. 101. Solution published in Vol. 31, No. 2, Spring 1997, pp. 196-197.
%H A185050 G. C. Greubel, <a href="/A185050/b185050.txt">Table of n, a(n) for n = 0..5000</a>
%H A185050 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GeometricSeries.html">Geometric Series</a>
%e A185050 a(1) = 5 because 1 + 2/3 + (2/3)^2 + (2/3)^3 + (2/3)^4 > 3 - 1/2.
%t A185050 lst = {}; n = s = 0; Do[s = s + (2/3)^k; If[s > 3 - 1/2^n, AppendTo[lst, k + 1]; n++], {k, 0, 112}]; lst
%K A185050 nonn
%O A185050 0,1
%A A185050 _Arkadiusz Wesolowski_, Dec 25 2012