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.

User: David W. Lewis

David W. Lewis's wiki page.

David W. Lewis has authored 1 sequences.

A350959 Number of ways to write 2*n+1 as 2^i (i >= 0) plus a prime.

Original entry on oeis.org

0, 1, 1, 2, 2, 2, 2, 3, 1, 3, 4, 2, 2, 3, 1, 2, 3, 3, 2, 4, 1, 2, 5, 2, 3, 3, 1, 3, 2, 1, 3, 4, 1, 2, 5, 2, 2, 6, 3, 2, 3, 3, 2, 4, 1, 3, 3, 2, 1, 3, 2, 2, 6, 2, 2, 5, 2, 3, 4, 1, 2, 2, 2, 0, 3, 3, 3, 5, 1, 4, 4, 3, 3, 4, 0, 2, 4, 2, 2, 4, 2, 1, 5, 3, 3, 5, 2, 3, 2, 1, 4, 4, 1, 2, 4, 1, 1, 6, 2, 4, 5
Offset: 0

Author

N. J. A. Sloane, Feb 06 2022, answering a question from David W. Lewis

Keywords

Crossrefs

Formula

a(n) = A109925(2*n+1). - R. J. Mathar, Mar 07 2022