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!)
A120326 Cumulative sum of the remainders when dividing primes by 3. 2
2, 2, 4, 5, 7, 8, 10, 11, 13, 15, 16, 17, 19, 20, 22, 24, 26, 27, 28, 30, 31, 32, 34, 36, 37, 39, 40, 42, 43, 45, 46, 48, 50, 51, 53, 54, 55, 56, 58, 60, 62, 63, 65, 66, 68, 69, 70, 71, 73, 74, 76, 78, 79, 81, 83, 85, 87, 88, 89, 91, 92, 94, 95, 97, 98, 100, 101, 102, 104, 105 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Partial sums of A039701. - Michel Marcus, Jan 21 2015
LINKS
FORMULA
a(n) = sum_{k=1..n} (prime(k) mod 3).
MATHEMATICA
s=0; lst={}; Do[p=Prime[n]; m=Mod[p, 3]; a=(p-m)/3; AppendTo[lst, s+=m], {n, 3*4!}]; lst (* Vladimir Joseph Stephan Orlovsky, May 24 2009 *)
Accumulate[Mod[Prime[Range[80]], 3]] (* Harvey P. Dale, Sep 17 2016 *)
CROSSREFS
Cf. A039701 (prime(n) mod 3).
Sequence in context: A053036 A308840 A067957 * A036406 A029007 A338202
KEYWORD
nonn
AUTHOR
Joost de Winter, Aug 27 2006
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 April 24 06:39 EDT 2024. Contains 371920 sequences. (Running on oeis4.)