This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A050200 Let p = prime(n). Then a(n) = p + (next prime >= p+1) + (next prime >= p+3). 0
 10, 15, 23, 29, 41, 47, 59, 65, 81, 97, 105, 119, 131, 137, 153, 171, 187, 195, 209, 223, 231, 245, 261, 283, 299, 311, 317, 329, 335, 367, 389, 405, 425, 437, 457, 465, 483, 497, 513, 531, 551, 563, 581, 587, 607, 621, 657, 677, 689, 695, 711, 731, 743, 765 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The occurrence of multiples of 3 in the sequence appears to converge to about 0.44. LINKS MATHEMATICA nextprim[n_] := Block[{k = n}, While[ ! PrimeQ[k], k++ ]; k]; f[n_] := (x = Prime[n]; nextprim[x] + nextprim[x + 1] + nextprim[x + 3]); Table[ f[n], {n, 54}] (* Robert G. Wilson v, Feb 12 2005 *) np[n_]:=Module[{pr=Prime[n]}, pr+NextPrime[pr+1]+NextPrime[pr+3]]; Join[ {10}, Array[ np, 60, 2]] (* Harvey P. Dale, Mar 04 2015 *) PROG (PARI) sumprime3(n) = { c1=0; c2=0; forprime(x=2, n, s = nextprime(x)+nextprime(x+1)+nextprime(x+3); c1++; if(s%3==0, c2++); print1(s" "); ); print(); print(c2/c1+.0) } CROSSREFS Cf. A034962. Sequence in context: A109373 A267329 A120138 * A034961 A207637 A171444 Adjacent sequences:  A050197 A050198 A050199 * A050201 A050202 A050203 KEYWORD easy,nonn AUTHOR Cino Hilliard, May 08 2003 EXTENSIONS Definition corrected by Zak Seidov, Robert G. Wilson v and Ralf Stephan, Feb 10 2005 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 August 17 11:01 EDT 2019. Contains 326057 sequences. (Running on oeis4.)