An Euler type sum: $sum_n=1^inftyfracH_n^(2)ncdot 4^n2n choose n$, where $H_n^(2)=sumlimits_k=1^nfrac1k^2$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
8
down vote

favorite
5












I've been trying to compute the following series for quite a while :



$$sum_n=1^inftyfracH_n^(2)ncdot 4^n2n choose n$$
where $H_n^(2)=sumlimits_k=1^nfrac1k^2$ are the generalized harmonic numbers of order 2.



I've already successfully computed the value of a lot of similar-looking series involving harmonic numbers and central binomial coefficients (by using Abel's transformation, finding the generating function...), and they all had closed forms in terms of the Riemann Zeta function, so I'm confident this one too has a nice closed form ; but it's a tough guy that resists my previous methods.



By numerical test, I suspect that the value is $frac32zeta(3)$.



Any idea for derivation ?







share|cite|improve this question


















  • 2




    What a fitting name!
    – Frank W.
    Aug 26 at 23:10














up vote
8
down vote

favorite
5












I've been trying to compute the following series for quite a while :



$$sum_n=1^inftyfracH_n^(2)ncdot 4^n2n choose n$$
where $H_n^(2)=sumlimits_k=1^nfrac1k^2$ are the generalized harmonic numbers of order 2.



I've already successfully computed the value of a lot of similar-looking series involving harmonic numbers and central binomial coefficients (by using Abel's transformation, finding the generating function...), and they all had closed forms in terms of the Riemann Zeta function, so I'm confident this one too has a nice closed form ; but it's a tough guy that resists my previous methods.



By numerical test, I suspect that the value is $frac32zeta(3)$.



Any idea for derivation ?







share|cite|improve this question


















  • 2




    What a fitting name!
    – Frank W.
    Aug 26 at 23:10












up vote
8
down vote

favorite
5









up vote
8
down vote

favorite
5






5





I've been trying to compute the following series for quite a while :



$$sum_n=1^inftyfracH_n^(2)ncdot 4^n2n choose n$$
where $H_n^(2)=sumlimits_k=1^nfrac1k^2$ are the generalized harmonic numbers of order 2.



I've already successfully computed the value of a lot of similar-looking series involving harmonic numbers and central binomial coefficients (by using Abel's transformation, finding the generating function...), and they all had closed forms in terms of the Riemann Zeta function, so I'm confident this one too has a nice closed form ; but it's a tough guy that resists my previous methods.



By numerical test, I suspect that the value is $frac32zeta(3)$.



Any idea for derivation ?







share|cite|improve this question














I've been trying to compute the following series for quite a while :



$$sum_n=1^inftyfracH_n^(2)ncdot 4^n2n choose n$$
where $H_n^(2)=sumlimits_k=1^nfrac1k^2$ are the generalized harmonic numbers of order 2.



I've already successfully computed the value of a lot of similar-looking series involving harmonic numbers and central binomial coefficients (by using Abel's transformation, finding the generating function...), and they all had closed forms in terms of the Riemann Zeta function, so I'm confident this one too has a nice closed form ; but it's a tough guy that resists my previous methods.



By numerical test, I suspect that the value is $frac32zeta(3)$.



Any idea for derivation ?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









Blue

44k868141




44k868141










asked Aug 26 at 23:01









Harmonic Sun

2697




2697







  • 2




    What a fitting name!
    – Frank W.
    Aug 26 at 23:10












  • 2




    What a fitting name!
    – Frank W.
    Aug 26 at 23:10







2




2




What a fitting name!
– Frank W.
Aug 26 at 23:10




What a fitting name!
– Frank W.
Aug 26 at 23:10










1 Answer
1






active

oldest

votes

















up vote
5
down vote













Since



$$ zeta(2)-H_n^(2) = int_0^1 x^n frac-log x1-x,dx $$
$$ sum_ngeq 1fracx^nn4^nbinom2nn = 2log(2)-2log(1+sqrt1-x) $$
the computation of your series boils down to the computation of the integral



$$ int_0^1fraclog(x)log(1+sqrt1-x)1-x,dx=int_0^1fraclog(1-x)log(1+sqrtx)x,dx $$
or the computation of the integral
$$ int_0^1fracleft[log(1-x)+log(1+x)right]log(1+x)x,dx $$
where
$$ int_0^1fraclog^2(1+x)x=fraczeta(3)4,qquad int_0^1fraclog(1-x)log(1+x)x,dx =-frac5,zeta(3)8$$
are simple to prove by Maclaurin series and Euler sums. Your conjecture is correct.






share|cite|improve this answer






















  • Thank you very much !
    – Harmonic Sun
    Aug 27 at 17:53










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895620%2fan-euler-type-sum-sum-n-1-infty-frach-n2n-cdot-4n2n-choose-n%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
5
down vote













Since



$$ zeta(2)-H_n^(2) = int_0^1 x^n frac-log x1-x,dx $$
$$ sum_ngeq 1fracx^nn4^nbinom2nn = 2log(2)-2log(1+sqrt1-x) $$
the computation of your series boils down to the computation of the integral



$$ int_0^1fraclog(x)log(1+sqrt1-x)1-x,dx=int_0^1fraclog(1-x)log(1+sqrtx)x,dx $$
or the computation of the integral
$$ int_0^1fracleft[log(1-x)+log(1+x)right]log(1+x)x,dx $$
where
$$ int_0^1fraclog^2(1+x)x=fraczeta(3)4,qquad int_0^1fraclog(1-x)log(1+x)x,dx =-frac5,zeta(3)8$$
are simple to prove by Maclaurin series and Euler sums. Your conjecture is correct.






share|cite|improve this answer






















  • Thank you very much !
    – Harmonic Sun
    Aug 27 at 17:53














up vote
5
down vote













Since



$$ zeta(2)-H_n^(2) = int_0^1 x^n frac-log x1-x,dx $$
$$ sum_ngeq 1fracx^nn4^nbinom2nn = 2log(2)-2log(1+sqrt1-x) $$
the computation of your series boils down to the computation of the integral



$$ int_0^1fraclog(x)log(1+sqrt1-x)1-x,dx=int_0^1fraclog(1-x)log(1+sqrtx)x,dx $$
or the computation of the integral
$$ int_0^1fracleft[log(1-x)+log(1+x)right]log(1+x)x,dx $$
where
$$ int_0^1fraclog^2(1+x)x=fraczeta(3)4,qquad int_0^1fraclog(1-x)log(1+x)x,dx =-frac5,zeta(3)8$$
are simple to prove by Maclaurin series and Euler sums. Your conjecture is correct.






share|cite|improve this answer






















  • Thank you very much !
    – Harmonic Sun
    Aug 27 at 17:53












up vote
5
down vote










up vote
5
down vote









Since



$$ zeta(2)-H_n^(2) = int_0^1 x^n frac-log x1-x,dx $$
$$ sum_ngeq 1fracx^nn4^nbinom2nn = 2log(2)-2log(1+sqrt1-x) $$
the computation of your series boils down to the computation of the integral



$$ int_0^1fraclog(x)log(1+sqrt1-x)1-x,dx=int_0^1fraclog(1-x)log(1+sqrtx)x,dx $$
or the computation of the integral
$$ int_0^1fracleft[log(1-x)+log(1+x)right]log(1+x)x,dx $$
where
$$ int_0^1fraclog^2(1+x)x=fraczeta(3)4,qquad int_0^1fraclog(1-x)log(1+x)x,dx =-frac5,zeta(3)8$$
are simple to prove by Maclaurin series and Euler sums. Your conjecture is correct.






share|cite|improve this answer














Since



$$ zeta(2)-H_n^(2) = int_0^1 x^n frac-log x1-x,dx $$
$$ sum_ngeq 1fracx^nn4^nbinom2nn = 2log(2)-2log(1+sqrt1-x) $$
the computation of your series boils down to the computation of the integral



$$ int_0^1fraclog(x)log(1+sqrt1-x)1-x,dx=int_0^1fraclog(1-x)log(1+sqrtx)x,dx $$
or the computation of the integral
$$ int_0^1fracleft[log(1-x)+log(1+x)right]log(1+x)x,dx $$
where
$$ int_0^1fraclog^2(1+x)x=fraczeta(3)4,qquad int_0^1fraclog(1-x)log(1+x)x,dx =-frac5,zeta(3)8$$
are simple to prove by Maclaurin series and Euler sums. Your conjecture is correct.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Aug 27 at 15:21

























answered Aug 27 at 15:12









Jack D'Aurizio♦

273k32268637




273k32268637











  • Thank you very much !
    – Harmonic Sun
    Aug 27 at 17:53
















  • Thank you very much !
    – Harmonic Sun
    Aug 27 at 17:53















Thank you very much !
– Harmonic Sun
Aug 27 at 17:53




Thank you very much !
– Harmonic Sun
Aug 27 at 17:53

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895620%2fan-euler-type-sum-sum-n-1-infty-frach-n2n-cdot-4n2n-choose-n%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

Why am i infinitely getting the same tweet with the Twitter Search API?

Carbon dioxide