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.

A212290 Difference between the smallest 10^n-bit prime and 2^(10^n-1).

Original entry on oeis.org

9, 255, 1239, 5895, 221961
Offset: 1

Views

Author

Keywords

Comments

a(5) found by Serge Batalov, Jun 11 2012.

Examples

			2^99+255 is the smallest 100-bit prime, 2^999+1239 is the smallest 1000-bit prime, etc.
		

Crossrefs

Binary analog of A096548.

Programs

  • PARI
    a(n)=nextprime(2^(10^n-1))-2^(10^n-1)