A079369 Costé prime expansion of e - 2.

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

Offset: 0

Author

N. J. A. Sloane, Feb 16 2003

Keywords

• nonn
• easy

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé 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

• G. C. Greubel, Table of n, a(n) for n = 0..2000
• A. Costé, Sur un système fibré lié à la suite des nombres premiers, Exper. Math., 11 (2002), 383-405.

Crossrefs

Cf. A079370, A079371, A079366, A079367, A079368.

Programs

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);

Mathematica

$MaxExtraPrecision = 500; P[x_] := Module[{y}, y = Ceiling[1/x]; If[PrimeQ[y], y, NextPrime[y]]]; F[x_] := Module[{y, i, t1}, y = x; t1 = {}; For[i = 1, i <= 100, i++, AppendTo[t1, p = P[y]]; y = p*y - 1]; t1]; F[E - 2] (* G. C. Greubel, Jan 21 2019 *)

Extensions

More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003