On the series \(\sum_{k=1}^\infty \binom {3k}{k}^{-1} k^{-n}x^k\) (Q812160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4222737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral representations of some series involving \({\binom {2k}k}^{-1} k^{-n}\) and some related series. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirically Determined Apéry-Like Formulae for ζ(4n+3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central Binomial Sums, Multiple Clausen Values, and Zeta Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluations of binomial series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Généralisation d'une construction de R. Apéry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interesting Series Involving the Central Binomial Coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the series \(\sum ^{\infty}_{k=1}\binom{2k}{k}^{-1}k^{-n}\) and related sums / rank
 
Normal rank

Latest revision as of 09:33, 24 June 2024

scientific article
Language Label Description Also known as
English
On the series \(\sum_{k=1}^\infty \binom {3k}{k}^{-1} k^{-n}x^k\)
scientific article

    Statements

    On the series \(\sum_{k=1}^\infty \binom {3k}{k}^{-1} k^{-n}x^k\) (English)
    0 references
    0 references
    23 January 2006
    0 references
    Inspired by Apéry's proof of the irrationality of \(\zeta(3)\), the author investigates sums \(S(n,m;x)=\sum_{k=1}^\infty k^{-n} \binom{3mk}{mk}^{-1}x^k\), where \(n,m\in\mathbb Z\), \(x\in\mathbb R\), \(n\geq0\), \(m>0\). The author gives a formula for \(S(n,1;x)\) (assuming \(n\geq2\), \(| x| \leq27/4\)) as a sum of two integrals, and shows how to obtain \(S(n,m;x)\) as a linear combination of the expressions \(S(n,1;\omega^j x^{1/m})\), where \(\omega\) is a primitive \(m\)th root of unity. As applications, several explicit formulas are computed for \(n\in\{0,1,2\}\) and \(m=1\). Some of these formulas have earlier been found experimentally by \textit{J. M. Borwein} and \textit{R. Girgensohn} [Aequationes Math. 70, No. 1--2, 25--36 (2005; Zbl 1078.05003)].
    0 references
    0 references
    combinatorial identity
    0 references
    inverse binomial series
    0 references
    hypergeometric series
    0 references
    polylogarithm
    0 references
    integral representation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references