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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103572 Sum of the (primes > 5 modulo 19). 0
 7, 18, 31, 48, 48, 52, 62, 74, 92, 95, 100, 109, 124, 126, 130, 140, 154, 170, 173, 180, 193, 195, 201, 209, 221, 235, 253, 266, 283, 287, 293, 309, 327, 332, 343, 358, 360, 368, 378, 379, 382, 389, 398, 400, 414, 432, 433, 438, 449, 462, 466, 476, 492, 495 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For Prime[q[ the sums of the primes > 5 to a prime modulo form a sequence of sequences: a(n,q) = Sum[Mod[Prime[i+3],Prime[q]],{i,1,n}] LINKS FORMULA a(n+1)-a(n) = A033633(n+4). MATHEMATICA a = Table[Sum[Mod[Prime[i + 3], 19], {i, 1, n}], {n, 1, 200}] CROSSREFS Sequence in context: A061876 A341008 A103571 * A049532 A156619 A033537 Adjacent sequences: A103569 A103570 A103571 * A103573 A103574 A103575 KEYWORD nonn AUTHOR Roger L. Bagula, Mar 23 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 09:39 EST 2022. Contains 358517 sequences. (Running on oeis4.)