|
Search: id:A079387
|
|
|
| A079387 |
|
Cost'{e} prime expansion of sqrt(3) - 1. |
|
+0
3
|
|
| 2, 3, 3, 7, 5, 7, 3, 37, 7, 3, 149, 19, 41, 17, 7, 3, 11, 2, 11, 17, 23, 19, 11, 5, 3, 5, 3, 3, 5, 2, 5, 2, 23, 7, 13, 13, 19, 37, 7, 41, 29, 11, 2, 11, 3, 3, 7, 7, 3, 23, 7, 19, 11, 11, 17, 11, 7, 5, 7, 5, 5, 3, 5, 2, 5, 7, 19, 31, 19, 17, 7, 5, 11, 3, 3, 3, 103, 853, 211, 23, 19, 17, 11, 7, 5
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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).
|
|
REFERENCES
|
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.
|
|
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 := 200: 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(sqrt(3)-1);
|
|
CROSSREFS
|
Cf. A079388, A079389, A079366-A079368.
Adjacent sequences: A079384 A079385 A079386 this_sequence A079388 A079389 A079390
Sequence in context: A105437 A088100 A097359 this_sequence A141061 A076557 A140407
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Feb 16 2003
|
|
EXTENSIONS
|
More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003
|
|
|
Search completed in 0.002 seconds
|
