|
Search: id:A104885
|
|
|
| A104885 |
|
Primes whose logarithms are known to possess binary BBP formulas. |
|
+0
4
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
CROSSREFS
|
Sequence in context: A094746 A049543 A109997 this_sequence A127052 A092570 A133956
Adjacent sequences: A104882 A104883 A104884 this_sequence A104886 A104887 A104888
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 29 2005
|
|
|
Search completed in 0.002 seconds
|
