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.

A092099 Smallest prime between 2^n and 2^(n+1) having a minimal number of 1's in binary representation, A091936(n) - 2^n.

Original entry on oeis.org

0, 1, 3, 1, 5, 3, 3, 1, 9, 9, 5, 3, 17, 33, 3, 1, 2049, 3, 65, 33, 17, 129, 9, 513, 35, 131073, 32769, 3, 32769, 3, 65, 81, 17, 513, 16385, 8193, 9, 2049, 33554433, 97, 65, 129, 515, 131073, 129, 32769, 5, 21, 1073741825, 8388609, 65, 2097153, 5, 8589934593, 3, 81
Offset: 1

Views

Author

Robert G. Wilson v, Feb 19 2004

Keywords

Crossrefs

Cf. A091936.

Programs

  • Mathematica
    (* First run the program for A091936 to define f[n] *) Join[{0}, Table[ f[n] - 2^n, {n, 2, 56}]] (* Robert G. Wilson v *)

Formula

A091936(n) - A000079(n).