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.

A211997 Smallest prime with at least n 1's when written in binary.

Original entry on oeis.org

2, 3, 7, 23, 31, 127, 127, 383, 991, 2039, 3583, 6143, 8191, 63487, 63487, 129023, 131071, 522239, 524287, 1966079, 4128767, 14680063, 14680063, 33546239, 67108351, 201064447, 260046847, 536739839, 1073479679, 2147483647, 2147483647, 8581545983, 16911433727, 32212254719
Offset: 1

Views

Author

Keywords

Comments

In contrast to the more vague statement in A061712, the existence of every term of this sequence follows from the Sierpinski theorems (see reference, point 28).

References

  • Ernst Trost, Primzahlen, Birkhäuser-Verlag, 1953.

Crossrefs

Formula

a(n) <= A061712(n).