|
Search: id:A131868
|
|
|
| A131868 |
|
a(n) = (2*n^2)^(-1)*Sum_{d|n} (-1)^(n+d)*moebius(n/d)*binomial(2*d,d). |
|
+0
1
|
|
| 1, 1, 1, 2, 5, 13, 35, 100, 300, 925, 2915, 9386, 30771, 102347, 344705, 1173960, 4037381, 14004912, 48954659, 172307930, 610269695, 2173656683, 7782070631, 27992709172, 101128485150, 366803656323, 1335349400274, 4877991428982
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
MAPLE
|
A131868 := proc(n) local a, d ; a := 0 ; for d in numtheory[divisors](n) do a := a+(-1)^(n+d)*numtheory[mobius](n/d)*binomial(2*d, d) ; od: a/2/n^2 ; end: seq(A131868(n), n=1..30) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 24 2007
|
|
MATHEMATICA
|
a = {}; For[n = 1, n < 30, n++, b = Divisors[n]; s = 0; For[j = 1, j < Length[b] + 1, j++, s = s + (-1)^(n + b[[j]])*MoebiusMu[n/b[[j]]]*Binomial[2*b[[j]], b[[j]]]]; AppendTo[a, s/(2*n^2)]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 26 2007
|
|
CROSSREFS
|
Cf. A022553.
Sequence in context: A126221 A107086 A089846 this_sequence A000747 A046171 A022854
Adjacent sequences: A131865 A131866 A131867 this_sequence A131869 A131870 A131871
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 04 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 24 2007
|
|
|
Search completed in 0.002 seconds
|
