login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A293361 The integer k that minimizes |k/2^n - e^2|. 3

%I #4 Oct 11 2017 18:14:11

%S 7,15,30,59,118,236,473,946,1892,3783,7566,15133,30266,60531,121062,

%T 242125,484249,968498,1936997,3873993,7747987,15495974,30991948,

%U 61983895,123967790,247935580,495871161,991742322,1983484643,3966969287,7933938573,15867877147

%N The integer k that minimizes |k/2^n - e^2|.

%H Clark Kimberling, <a href="/A293361/b293361.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = floor(1/2 + (e^2)*2^n).

%F a(n) = A293359(n) if (fractional part of (e^2)*2^n) < 1/2, else a(n) = A293360(n).

%t z = 120; r = E^2;

%t Table[Floor[r*2^n], {n, 0, z}]; (* A293359 *)

%t Table[Ceiling[r*2^n], {n, 0, z}]; (* A293360 *)

%t Table[Round[r*2^n], {n, 0, z}]; (* A293361 *)

%Y Cf. A072334, A293359, A293360.

%K nonn,easy

%O 0,1

%A _Clark Kimberling_, Oct 11 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 14:42 EDT 2024. Contains 375369 sequences. (Running on oeis4.)