Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099726
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099726 A004125(A000040(n)): Sum of remainders of the n-th prime mod k, for k = 1,2,3,...,n. +0
1
0, 1, 3, 5, 7, 7, 14, 18, 28, 30, 31, 26, 38, 45, 63, 71, 93, 75, 96, 115, 101, 142, 161, 167, 152, 159, 203, 224, 219, 222, 216, 250, 263, 296, 341, 320, 319, 349, 433, 427, 496, 419, 487, 481, 538, 537, 495, 631, 635, 676, 697, 777, 665, 820, 784, 874, 929, 856 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(7)=14 because the 7th prime is 17 and its remainders modulo 1,2,3,4,5,6,7 are 0,1,2,1,2,5,3 respectively and 0+1+2+1+2+5+3=14.

MAPLE

umpf:=n->add(modp(floor(ithprime(n)), m), m=1..n); seq(umpf(k), k=1..120);

CROSSREFS

Cf. A000040, A004125.

Sequence in context: A060265 A098566 A006540 this_sequence A131979 A101496 A008508

Adjacent sequences: A099723 A099724 A099725 this_sequence A099727 A099728 A099729

KEYWORD

easy,nonn

AUTHOR

Joseph Biberstine (jrbibers(AT)indiana.edu), Nov 07 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research