id:A024934 - OEIS Search Results

Search: id:A024934

Displaying 1-1 of 1 results found.

page 1

a(n) = sum of remainders of n mod p(k), over all k such that p(k) < n.

+0
5

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; listen)

	OFFSET	`2,5`
	COMMENT	`Equivalently, sum of remainders when dividing n by all primes p(k) <=n.`
	EXAMPLE	`a(5) = 3. The remainder when 5 is divided by 2,3 respectively is 1,2 and their sum = 3.` `10 = 25+0 = 33+1 = 52+0 = 71+3: a(10) = 0+1+0+3 = 4.`
	CROSSREFS	`Cf. A004125, A067435, A067436, A013939.` `Sequence in context: A100954 A071315 A072267 this_sequence A049918 A028861 A081521` `Adjacent sequences: A024931 A024932 A024933 this_sequence A024935 A024936 A024937`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research