login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024934 Sum of remainders n mod p, over all primes p < n. 8
0, 0, 1, 1, 3, 1, 4, 6, 7, 4, 8, 8, 13, 10, 8, 12, 18, 20, 27, 28, 26, 21, 29, 33, 37, 31, 37, 37, 46, 46, 56, 65, 62, 54, 53, 59, 70, 61, 57, 62, 74, 75, 88, 89, 95, 84, 98, 108, 116, 124, 119, 119, 134, 145, 145, 152, 146, 131, 147, 154, 171, 156, 164, 180, 180, 182, 200, 200, 193, 198, 217 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

FORMULA

a(n) = n*A000720(n) - A024924(n). [From Max Alekseyev]

EXAMPLE

a(5) = 3. The remainder when 5 is divided by primes 2, 3 respectively is 1, 2, and their sum = 3.

10 = 2*5+0 = 3*3+1 = 5*2+0 = 7*1+3: a(10) = 0+1+0+3 = 4.

CROSSREFS

Cf. A004125, A067435, A067436, A013939.

Sequence in context: A100954 A071315 A072267 * A186358 A170839 A049918

Adjacent sequences:  A024931 A024932 A024933 * A024935 A024936 A024937

KEYWORD

nonn,changed

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Edited by Max Alekseyev (maxale(AT)gmail.com), Jan 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.