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 A293360 #7 Nov 23 2024 17:51:12
%S A293360 8,15,30,60,119,237,473,946,1892,3784,7567,15133,30266,60532,121063,
%T A293360 242125,484250,968499,1936997,3873994,7747987,15495974,30991948,
%U A293360 61983896,123967791,247935581,495871161,991742322,1983484644,3966969287,7933938574,15867877147
%N A293360 Least integer k such that k/2^n > e^2.
%H A293360 Clark Kimberling, <a href="/A293360/b293360.txt">Table of n, a(n) for n = 0..1000</a>
%F A293360 a(n) = ceiling(r*2^n), where r = e^2.
%F A293360 a(n) = A293359(n) + 1.
%t A293360 z = 120; r = E^2;
%t A293360 Table[Floor[r*2^n], {n, 0, z}]; (* A293359 *)
%t A293360 Table[Ceiling[r*2^n], {n, 0, z}]; (* A293360 *)
%t A293360 Table[Round[r*2^n], {n, 0, z}]; (* A293361 *)
%Y A293360 Cf. A072334, A293359, A293361.
%K A293360 nonn,easy
%O A293360 0,1
%A A293360 _Clark Kimberling_, Oct 11 2017