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.

Previous Showing 21-21 of 21 results.

A294154 Base-2 logarithm of product of primes between 2^n+1 and 2^(n+1).

Original entry on oeis.org

1, 1, 5, 7, 22, 39, 84, 173, 367, 716, 1444, 2945, 5823, 11817, 23457, 47117, 94496, 188670, 378296, 755437, 1512435, 3024742, 6049260, 12099777, 24205776, 48402649, 96809896, 193632363, 387252738, 774544273, 1549044943
Offset: 0

Views

Author

Olivier Gérard, Oct 24 2017

Keywords

Comments

Inspired by Bertrand's postulate and complexity of algorithms using Farey fraction sets of size 2^n.
The log of this sequence seems linear after a few terms.

Crossrefs

Cf. A036378 (number of primes between 2^n+1 and 2^(n+1)).
Cf. A293696, A293697 (additive view of the primes between 2^n+1 and 2^(n+1)).

Programs

  • Mathematica
    Table[Floor[
  Log[2, Times @@
    Table[Prime[i], {i, PrimePi[2^(n)] + 1,
      PrimePi[2^(n + 1)]}]]], {n, 0, 20}]

Extensions

a(26)-a(30) from Robert Price, Nov 30 2017
Previous Showing 21-21 of 21 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.