id:A063088 - OEIS Search Results

Search: id:A063088

Displaying 1-1 of 1 results found.

page 1

Sum_{k=1..n} phi(k) - Sum{k=1..n} d(k), where d() is the number of divisors function.

+0
1

0, -1, -1, -2, 0, -2, 2, 2, 5, 5, 13, 11, 21, 23, 27, 30, 44, 44, 60, 62, 70, 76, 96, 96, 113, 121, 135, 141, 167, 167, 195, 205, 221, 233, 253, 256, 290, 304, 324, 332, 370, 374, 414, 428, 446, 464, 508, 514, 553, 567, 595, 613, 663, 673, 709, 725, 757, 781, 837, 841, 899, 925, 955, 980, 1024, 1036, 1100, 1126, 1166 (list; graph; listen)

	OFFSET	`1,4`
	PROGRAM	`(PARI) j=[]; for(n=1, 200, a=sum(k=1, n, eulerphi(k)); b=sum(k=1, n, numdiv(k)); j=concat(j, a-b)); j`
	CROSSREFS	`Cf. A002088, A006218.` `Adjacent sequences: A063085 A063086 A063087 this_sequence A063089 A063090 A063091` `Sequence in context: A044949 A044950 A036461 this_sequence A101276 A103863 A061199`
	KEYWORD	`easy,sign`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Aug 06 2001`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research