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 A128093 #18 Aug 24 2023 12:02:05 %S A128093 2,4,9,16,35,66,133,256,513,1030,2057,4104,8203,16394,32775,65536, %T A128093 131087,262152,524305,1048580,2097165,4194322,8388629,16777224, %U A128093 33554450,67108886,134217729,268435468,536870939,1073741850,2147483677 %N A128093 a(n) = smallest multiple of n which is >= 2^n. %H A128093 G. C. Greubel, <a href="/A128093/b128093.txt">Table of n, a(n) for n = 1..1000</a> %F A128093 a(n) = n * ceiling(2^n/n) = n * A053638(n). %t A128093 f[n_] := n*Ceiling[2^n/n];Array[f, 33] (* _Ray Chandler_, Feb 19 2007 *) %o A128093 (Python) %o A128093 def A128093(n): return (m:=1<<n)+(n-k if (k:=m%n) else -k) # _Chai Wah Wu_, Aug 24 2023 %Y A128093 Cf. A128092, A053638. %K A128093 nonn %O A128093 1,1 %A A128093 _Leroy Quet_, Feb 14 2007 %E A128093 Extended by _Ray Chandler_, Feb 19 2007