|
Search: id:A079249
|
|
|
| A079249 |
|
Sum of p in all pairs (p,q), 0<=p<q, p+q divides n. |
|
+0
1
|
|
| 0, 0, 1, 1, 3, 4, 6, 7, 11, 13, 15, 20, 21, 27, 32, 35, 36, 50, 45, 59, 62, 70, 66, 92, 81, 99, 102, 119, 105, 150, 120, 155, 152, 172, 162, 219, 171, 216, 212, 255, 210, 296, 231, 302, 295, 319, 276, 396, 306, 391, 362, 425, 351, 492, 396, 503, 452, 511, 435, 646
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
G.f.: Sum_{n>1} x^(3*n)/(1-x^n)/(1-x^(2*n))^2.
|
|
EXAMPLE
|
There are 7 pairs (p,q), 0<=p<q, such that p+q divides 6: (0,1), (0,2), (0,3), (0,6), (1, 2), (1, 5), (2, 4); thus a(6) = 0+0+0+0+1+1+2=4.
|
|
CROSSREFS
|
Cf. A008805.
Sequence in context: A064404 A047514 A011975 this_sequence A075434 A085253 A073906
Adjacent sequences: A079246 A079247 A079248 this_sequence A079250 A079251 A079252
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 03 2003
|
|
|
Search completed in 0.002 seconds
|
