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.

A186945 The smallest integer x > 0 such that the number of terms of A050376 in (x/2,x] equals n.

Original entry on oeis.org

2, 3, 5, 13, 17, 25, 31, 49, 61, 71, 73, 81, 103, 109, 113, 131, 139, 157, 173, 181, 191, 193, 199, 239, 241, 257, 269, 271, 283, 289, 293, 313, 353, 361, 373, 379, 409, 419, 421, 433, 439, 443, 463, 491, 499, 509, 571, 577, 599, 601, 607, 613, 619, 643, 647
Offset: 1

Views

Author

Vladimir Shevelev, Aug 30 2013

Keywords

Comments

The sequence is an analog of Labos primes (A080359) in Fermi-Dirac arithmetic, since in this arithmetic terms of A050376 play role of primes (see comments in A050376).

Crossrefs

Formula

a(n) <= A228520(n).

Extensions

More terms from Peter J. C. Moses