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.

A104885 Primes whose logarithms are known to possess binary BBP formulas.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 29, 31, 37, 41, 43, 61, 73, 109, 113, 127, 151, 241, 257, 331, 337, 397, 683, 1321, 1429, 1613, 2113, 2731, 5419, 8191, 14449, 26317, 38737, 43691, 61681, 65537, 87211, 131071, 174763, 246241, 262657, 268501, 279073, 312709
Offset: 1

Views

Author

Gary W. Adamson, Mar 29 2005

Keywords

Comments

It is unknown whether the list of such primes is finite or infinite. A BBP-type formula is one with a base b = 2^p for some integer. Most of the formulas have been discovered experimentally using PSLQ searches.

References

  • David H. Bailey, Peter B. Borwein and Simon Plouffe. "On the Rapid Computation of Various Polylogarithmic Constants", Mathematics of Computation, 66:903-913, 1997. Jonathan Borwein, David Bailey; "Mathematics by Experiment, Plausible Reasoning in the 21st Century", A. K. Peters, 2004; p. 130.

Formula

Algorithm originated by Bailey, Borwein and Plouffe.