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.

A080340 First known infinite sequence containing no odd integer of the form 2^m+p (p prime).

Original entry on oeis.org

7629217, 18814027, 29998837, 41183647, 52368457, 63553267, 74738077, 85922887, 97107697, 108292507, 119477317, 130662127, 141846937, 153031747, 164216557, 175401367, 186586177, 197770987, 208955797, 220140607, 231325417, 242510227
Offset: 0

Views

Author

Benoit Cloitre, Mar 19 2003

Keywords

Comments

To a question of Romanoff: Are there infinitely many odd integers not of the form 2^m+p where p is prime? Erdős answered Yes in 1950 by constructing the present sequence, an infinite arithmetic sequence, using a system of congruences.

Formula

a(n) = n*11184810 + 7629217.
G.f.: (7629217 + 3555593*x)/(1 - x)^2. - Stefano Spezia, Apr 25 2025