This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225669 Slowest-growing sequence of odd primes whose reciprocals sum to 1. 3
 3, 5, 7, 11, 13, 17, 19, 23, 967, 101419, 2000490719, 106298338760698351, 586903266015193517540253132922939, 3494365451928289992209032562272585187947069047023572601254975717 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See comments, references, and links in A075442 = slowest-growing sequence of primes whose reciprocals sum to 1. a(n) = 3, 5, 7, 11, 13, 17, 19, 23, 967, ..., so A225671(2) = 23. REFERENCES Popular Computing (Calabasas, CA), Problem 175: A Sum of a Different Kind, Vol. 5 (No. 50, May 1977), p. PC50-8. LINKS EXAMPLE Since 1/3 + 1/5 + 1/7 + 1/11 + 1/13 + 1/17 + 1/19 + 1/23 < 1, the first eight odd primes are members. The ninth is not, because adding 1/29 pushes the sum over 1. MATHEMATICA a[n_] := a[n] = Block[{sm = Sum[1/(a[i]), {i, n - 1}]}, NextPrime[ Max[ a[n - 1], 1/(1 - sm)]]]; a[0] = 2; Array[a, 14] CROSSREFS Cf. A000058, A075442, A046689, A136616, A181503, A225670, A225671. Sequence in context: A204142 A131261 A100276 * A065389 A123567 A059645 Adjacent sequences:  A225666 A225667 A225668 * A225670 A225671 A225672 KEYWORD nonn AUTHOR Jonathan Sondow, May 11 2013 STATUS approved

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

Last modified December 12 05:15 EST 2018. Contains 318052 sequences. (Running on oeis4.)