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 A293361 #4 Oct 11 2017 18:14:11 %S A293361 7,15,30,59,118,236,473,946,1892,3783,7566,15133,30266,60531,121062, %T A293361 242125,484249,968498,1936997,3873993,7747987,15495974,30991948, %U A293361 61983895,123967790,247935580,495871161,991742322,1983484643,3966969287,7933938573,15867877147 %N A293361 The integer k that minimizes |k/2^n - e^2|. %H A293361 Clark Kimberling, <a href="/A293361/b293361.txt">Table of n, a(n) for n = 0..1000</a> %F A293361 a(n) = floor(1/2 + (e^2)*2^n). %F A293361 a(n) = A293359(n) if (fractional part of (e^2)*2^n) < 1/2, else a(n) = A293360(n). %t A293361 z = 120; r = E^2; %t A293361 Table[Floor[r*2^n], {n, 0, z}]; (* A293359 *) %t A293361 Table[Ceiling[r*2^n], {n, 0, z}]; (* A293360 *) %t A293361 Table[Round[r*2^n], {n, 0, z}]; (* A293361 *) %Y A293361 Cf. A072334, A293359, A293360. %K A293361 nonn,easy %O A293361 0,1 %A A293361 _Clark Kimberling_, Oct 11 2017