cp's OEIS Frontend

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.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Leroy Quet, Feb 14 2007

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_] := n*Ceiling[2^n/n];Array[f, 33] (* Ray Chandler, Feb 19 2007 *)
  • Python
    def A128093(n): return (m:=1<Chai Wah Wu, Aug 24 2023

Formula

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

Extensions

Extended by Ray Chandler, Feb 19 2007