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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128093 a(n) = smallest multiple of n which is >= 2^n. 2
 2, 4, 9, 16, 35, 66, 133, 256, 513, 1030, 2057, 4104, 8203, 16394, 32775, 65536, 131087, 262152, 524305, 1048580, 2097165, 4194322, 8388629, 16777224, 33554450, 67108886, 134217729, 268435468, 536870939, 1073741850, 2147483677 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA a(n) = n * ceiling(2^n/n) = n * A053638(n). MATHEMATICA f[n_] := n*Ceiling[2^n/n]; Array[f, 33] (* Ray Chandler, Feb 19 2007 *) CROSSREFS Cf. A128092, A053638. Sequence in context: A062791 A203320 A005980 * A056331 A056336 A203318 Adjacent sequences:  A128090 A128091 A128092 * A128094 A128095 A128096 KEYWORD nonn AUTHOR Leroy Quet, Feb 14 2007 EXTENSIONS Extended by Ray Chandler, Feb 19 2007 STATUS approved

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.

Last modified June 15 00:00 EDT 2021. Contains 345041 sequences. (Running on oeis4.)