|
Search: id:A063088
|
|
|
| A063088 |
|
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
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
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
(PARI) { a=0; for (n=1, 1000, write("b063088.txt", n, " ", a+=eulerphi(n) - numdiv(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 17 2009]
|
|
CROSSREFS
|
Cf. A002088, A006218.
Sequence in context: A044950 A161872 A036461 this_sequence A101276 A103863 A166395
Adjacent sequences: A063085 A063086 A063087 this_sequence A063089 A063090 A063091
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Aug 06 2001
|
|
|
Search completed in 0.002 seconds
|
