login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080351 Costé prime expansion of 1/exp(1). 0
3, 11, 11, 2, 13, 23, 17, 23, 7, 7, 5, 3, 13, 11, 5, 3, 23, 17, 7, 5, 5, 3, 5, 3, 5, 5, 3, 5, 2, 149, 19, 103, 577, 389, 1039, 223, 29, 11, 3, 3, 7, 5, 2, 7, 3, 191, 47, 13, 11, 7, 5, 3, 7, 3, 7, 13, 29, 11, 3, 3, 3, 3, 5, 5, 2, 5, 2, 5, 3, 79, 137, 173, 59, 157, 29, 17, 7, 13, 79, 281 (list; graph; refs; listen; history; text; 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é 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é, Sur un système fibré lié à 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(1/exp(1));
CROSSREFS
Sequence in context: A257538 A304052 A303122 * A178709 A168378 A248410
KEYWORD
nonn,easy
AUTHOR
Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 00:32 EST 2024. Contains 370308 sequences. (Running on oeis4.)