|
Search: id:A007547
|
|
|
| A007547 |
|
Number of steps to compute n-th prime in PRIMEGAME (slow version).
(Formerly M5075)
|
|
+0
3
|
|
| 19, 69, 281, 710, 2375, 3893, 8102, 11361, 19268, 36981, 45680, 75417, 101354, 118093, 152344, 215797, 293897, 327571, 429229
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. H. Conway, FRACTRAN: a simple universal programming language for arithmetic, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 4-26.
R. K. Guy, Conway's prime producing machine. Math. Mag. 56 (1983), no. 1, 26-33.
D. Olivastro, Ancient Puzzles. Bantam Books, NY, 1993, p. 21.
|
|
CROSSREFS
|
Cf. A007542, A007546.
Sequence in context: A044157 A044538 A007546 this_sequence A010007 A093350 A142516
Adjacent sequences: A007544 A007545 A007546 this_sequence A007548 A007549 A007550
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
