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!)
 A094662 Prime numerators of the sums of the ratios of consecutive primes. 1
 3, 19, 137, 1289, 4975049, 19374829215705183817985416854342477445596764166957007 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sum of reciprocals = 0.3941031881461705902079511494... The next term, A094661(53) ~ 1.497*10^100, is too large to include. It might be preferable to record the index of these primes in A094661: a(n)=A094661(b(n)) with b=(1,2,3,4,7,32,53,55,94,183,189,...). - M. F. Hasler, Mar 06 2009 LINKS FORMULA A094662 = A094661 intersect A000040. EXAMPLE 3/2 + 5/3 + 7/5 + 11/7 + 13/11 + 17/13 + 19/17 = 4975049/510510. 4975049 is prime, the fifth entry in the sequence. MATHEMATICA Select[Numerator[Accumulate[#[[2]]/#[[1]]&/@Partition[Prime[Range[ 100]], 2, 1]]], PrimeQ] (* Harvey P. Dale, Jun 01 2018 *) PROG (PARI) consecpr(n) = { s=0; y=0; forprime(x=2, n, y+=nextprime(x+1)/x; z=numerator(y); s+=1./z; if(isprime(z), print1(z", ")) ); print(); print(s) } (PARI) s=0; for( i=1, 999, isprime(numerator(s+=prime(i+1)/prime(i))) & print1(numerator(s)", ")) \\ M. F. Hasler, Mar 06 2009 CROSSREFS Sequence in context: A138513 A321515 A094661 * A321349 A115750 A156894 Adjacent sequences:  A094659 A094660 A094661 * A094663 A094664 A094665 KEYWORD frac,nonn AUTHOR Cino Hilliard, Jun 06 2004 EXTENSIONS Corrected and edited by M. F. Hasler, Mar 07 2009 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 15 01:20 EST 2018. Contains 318141 sequences. (Running on oeis4.)