login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128093 a(n) = smallest multiple of n which is >= 2^n. 2

%I

%S 2,4,9,16,35,66,133,256,513,1030,2057,4104,8203,16394,32775,65536,

%T 131087,262152,524305,1048580,2097165,4194322,8388629,16777224,

%U 33554450,67108886,134217729,268435468,536870939,1073741850,2147483677

%N a(n) = smallest multiple of n which is >= 2^n.

%H G. C. Greubel, <a href="/A128093/b128093.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = n * ceiling(2^n/n) = n * A053638(n).

%t f[n_] := n*Ceiling[2^n/n];Array[f, 33] (* _Ray Chandler_, Feb 19 2007 *)

%Y Cf. A128092, A053638.

%K nonn

%O 1,1

%A _Leroy Quet_, Feb 14 2007

%E Extended by _Ray Chandler_, Feb 19 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 17:21 EDT 2021. Contains 346439 sequences. (Running on oeis4.)