|
| |
|
|
A079369
|
|
Cost'{e} prime expansion of e - 2.
|
|
3
| |
|
|
2, 3, 5, 2, 11, 17, 11, 3, 37, 11, 11, 3, 5, 2, 11, 2, 11, 2, 53, 37, 7, 7, 73, 73, 79, 19, 17, 11, 5, 37, 7, 5, 7, 29, 277, 2903, 607, 211, 29, 11, 739, 9463, 8693, 3907, 307, 23, 223, 59, 37, 11, 2, 41, 23, 11, 3, 23, 7, 5, 5, 2, 11, 5, 7, 7, 5, 2, 5, 2, 5, 3, 67, 41, 223, 31, 107
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Cost'{e} prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).
|
|
|
LINKS
| A. Cost'{e} [Coste], Sur un syst`{e}me fibr'{e} li'{e} a la suite des nombres premiers, Exper. Math., 11 (2002), 383-405.
|
|
|
MAPLE
| Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y, i, t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1), p]; y := p*y-1; od; t1; end; F(exp(1)-2);
|
|
|
CROSSREFS
| Cf. A079370, A079371, A079366-A079368.
Sequence in context: A021429 A124055 A137458 * A102867 A139044 A060383
Adjacent sequences: A079366 A079367 A079368 * A079370 A079371 A079372
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Feb 16 2003
|
|
|
EXTENSIONS
| More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003
|
| |
|
|
