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.

A091937 Greatest number of 1's in binary representations of primes between 2^n and 2^(n+1).

Original entry on oeis.org

2, 3, 3, 5, 5, 7, 7, 8, 9, 10, 11, 13, 13, 13, 15, 17, 17, 19, 19, 20, 21, 21, 23, 24, 25, 25, 27, 28, 29, 31, 31, 32, 33, 34, 35, 35, 37, 37, 39, 40, 41, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 53, 55, 56, 56, 58, 59, 61, 61, 61, 63, 64, 65, 66, 67, 68, 69, 69, 71, 72
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 14 2004

Keywords

Comments

a(n) = A000120(A091938(n)).

Crossrefs

Cf. A091935.

Programs

  • Mathematica
    Run the second Mathematica line of A091938, then Count[ IntegerDigits[ #, 2], 1] & /@ Table[ f[n], {n, 75}]

Extensions

More terms from Robert G. Wilson v, Feb 20 2004