|
Search: id:A079614
|
|
| |
|
| 1, 2, 5, 1, 6, 4, 7, 5, 9, 7, 7, 9, 0, 5
(list; cons; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
From Bertrand's postulate (i.e. there is always a prime p in the range n<p<2n) one can show there is a constant b such that floor(2^b), floor(2^2^b), ...,floor(2^2^2...^b),.... are all primes.
|
|
LINKS
|
C. K. Caldwell, Prime Curious! 137438953481. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2009]
|
|
FORMULA
|
b=1.2516475977905...
|
|
CROSSREFS
|
Sequence in context: A046527 A008343 A093952 this_sequence A084245 A065224 A165278
Adjacent sequences: A079611 A079612 A079613 this_sequence A079615 A079616 A079617
|
|
KEYWORD
|
cons,hard,more,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 29 2003
|
|
|
Search completed in 0.002 seconds
|
