A005429 -id:A005429 - cp's OEIS frontend

A005259 Apery (Apéry) numbers: Sum_{k=0..n} (binomial(n,k)*binomial(n+k,k))^2.

1, 5, 73, 1445, 33001, 819005, 21460825, 584307365, 16367912425, 468690849005, 13657436403073, 403676083788125, 12073365010564729, 364713572395983725, 11111571997143198073, 341034504521827105445, 10534522198396293262825, 327259338516161442321485

Offset: 0

Simon Plouffe, N. J. A. Sloane, May 20 1991

Conjecture: For each n = 1,2,3,... the Apéry polynomial A_n(x) = Sum_{k = 0..n} binomial(n,k)^2*binomial(n+k,k)^2*x^k is irreducible over the field of rational numbers. - Zhi-Wei Sun, Mar 21 2013
The expansions of exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + 5*x + 49*x^2 + 685*x^3 + 11807*x^4 + 232771*x^5 + ... and exp( Sum_{n >= 1} a(n-1)*x^n/n ) = 1 + 3*x + 27*x^2 + 390*x^3 + 7038*x^4 + 144550*x^5 + ... both appear to have integer coefficients. See A267220. - Peter Bala, Jan 12 2016
Diagonal of the rational function R(x, y, z, w) = 1 / (1 - (w*x*y*z + w*x*y + w*z + x*y + x*z + y + z)); also diagonal of rational function H(x, y, z, w) = 1/(1 - w*(1+x)*(1+y)*(1+z)*(x*y*z + y*z + y + z + 1)). - Gheorghe Coserea, Jun 26 2018
Named after the French mathematician Roger Apéry (1916-1994). - Amiram Eldar, Jun 10 2021

			G.f. = 1 + 5*x + 73*x^2 + 1445*x^3 + 33001*x^4 + 819005*x^5 + 21460825*x^6 + ...
a(2) = (binomial(2,0) * binomial(2+0,0))^2 + (binomial(2,1) * binomial(2+1,1))^2 + (binomial(2,2) * binomial(2+2,2))^2 = (1*1)^2 + (2*3)^2 + (1*6)^2 = 1 + 36 + 36 = 73. - _Michael B. Porter_, Jul 14 2016

Julian Havil, The Irrationals, Princeton University Press, Princeton and Oxford, 2012, pp. 137-153.
Wolfram Koepf, Hypergeometric Identities. Ch. 2 in Hypergeometric Summation: An Algorithmic Approach to Summation and Special Function Identities. Braunschweig, Germany: Vieweg, pp. 55, 119 and 146, 1998.
Maxim Kontsevich and Don Zagier, Periods, pp. 771-808 of B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and Beyond, 2 vols., Springer-Verlag, 2001.
Leonard Lipshitz and Alfred van der Poorten, "Rational functions, diagonals, automata and arithmetic." In Number Theory, Richard A. Mollin, ed., Walter de Gruyter, Berlin (1990), pp. 339-358.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..656 (first 101 terms from T. D. Noe)
Boris Adamczewski, Jason P. Bell and Eric Delaygue, Algebraic independence of G-functions and congruences "a la Lucas", arXiv preprint arXiv:1603.04187 [math.NT], 2016.
Jean-Paul Allouche, A remark on Apéry's numbers, J. Comput. Appl. Math., Vol. 83 (1997), pp. 123-125.
Roger Apéry, Irrationalité de zeta(2) et zeta(3), in Journées Arith. de Luminy. Colloque International du Centre National de la Recherche Scientifique (CNRS) held at the Centre Universitaire de Luminy, Luminy, Jun 20-24, 1978. Astérisque, Vol. 61 (1979), pp. 11-13.
Roger Apéry, Sur certaines séries entières arithmétiques, Groupe de travail d'analyse ultramétrique, Vol. 9, No. 1 (1981-1982), Exp. No. 16, 2 p.
Roger Apéry, Interpolation de fractions continues et irrationalité de certaines constantes, Bulletin de la section des sciences du C.T.H.S III (1981), pp. 37-53.
Thomas Baruchel and Carsten Elsner, On error sums formed by rational approximations with split denominators, arXiv preprint arXiv:1602.06445 [math.NT], 2016.
Frits Beukers, Another congruence for the Apéry numbers, J. Number Theory, Vol. 25, No. 2 (1987), pp. 201-210.
Frits Beukers, Consequences of Apéry's work on zeta(3), in "Zeta(3) irrationnel: les retombées", Rencontres Arithmétiques de Caen, June 2-3, 1995 [Mentions divisibility of a(n) by powers of 5 and powers of 11]
Francis Brown, Irrationality proofs for zeta values, moduli spaces and dinner parties, arXiv:1412.6508 [math.NT], 2014.
William Y. C. Chen, Qing-Hu Hou and Yan-Ping Mu, A telescoping method for double summations, J. Comp. Appl. Math., Vol. 196, No. 2 (2006), pp. 553-566, Example 4.
Shaun Cooper, Apéry-like sequences defined by four-term recurrence relations, arXiv:2302.00757 [math.NT], 2023. See Table 2 p. 7.
M. Coster, Email, Nov 1990
Eric Delaygue, Arithmetic properties of Apéry-like numbers, arXiv preprint arXiv:1310.4131 [math.NT], 2013.
Emeric Deutsch and Bruce E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, arXiv:math/0407326 [math.CO], 2004.
Emeric Deutsch and Bruce E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Num. Theory 117 (2006), 191-215.
Gerald A. Edgar, A formula with Legendre polynomials, Sci. Math. Research posting Mar 21 2005.
G. A. Edgar, The Apéry Numbers as a Stieltjes Moment Sequence, arXiv:2005.10733 [math.CA], 2020.
Carsten Elsner, On recurrence formulas for sums involving binomial coefficients, Fib. Q., Vol. 43, No. 1 (2005), pp. 31-45.
Carsten Elsner, On prime-detecting sequences from Apéry's recurrence formulas for zeta(3) and zeta(2), JIS, Vol. 11 (2008), Article 08.5.1.
Stéphane Fischler, Irrationalité de valeurs de zeta, arXiv:math/0303066 [math.NT], 2003.
Scott Garrabrant and Igor Pak, Counting with irrational tiles, arXiv:1407.8222 [math.CO], 2014.
Ira Gessel, Some congruences for Apéry numbers, Journal of Number Theory, Vol. 14, No. 3 (1982) 362-368.
Ofir Gorodetsky, New representations for all sporadic Apéry-like sequences, with applications to congruences, arXiv:2102.11839 [math.NT], 2021. See gamma p. 3.
Richard K. Guy, Letter to N. J. A. Sloane, Oct 1985
Vaclav Kotesovec, Asymptotic of generalized Apéry sequences with powers of binomial coefficients, Nov 04 2012
Antoine Labelle et al., A formula for Apéry numbers, MathOverflow, 2025.
Leonard Lipshitz and Alfred J. van der Poorten, Rational functions, diagonals, automata and arithmetic, in: Richard A. Mollin (ed.), Number theory, Proceedings of the First Conference of the Canadian Number Theory Association Held at the Banff Center, Banff, Alberta, April 17-27, 1988, de Gruyter, 2016, pp. 339-358; alternative link; Wayback Machine copy.
Ji-Cai Liu, Supercongruences for the (p-1)th Apéry number, arXiv:1803.11442 [math.NT], 2018.
Amita Malik and Armin Straub, Divisibility properties of sporadic Apéry-like numbers, Research in Number Theory, Vol. 2 (2016), Article 5.
Stephen Melczer and Bruno Salvy, Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables, arXiv:1605.00402 [cs.SC], 2016.
Romeo Meštrović, Lucas' theorem: its generalizations, extensions and applications (1878--2014), arXiv preprint arXiv:1409.3820 [math.NT], 2014.
Robert Osburn and Brundaban Sahu, A supercongruence for generalized Domb numbers, Funct. Approx. Comment. Math., Vol. 48, No. 1 (2013), pp. 29-36; alternative link.
Math Overflow, A conjectured formula for Apéry numbers
Eric Rowland and Reem Yassawi, Automatic congruences for diagonals of rational functions, Journal de théorie des nombres de Bordeaux, Vol. 27, No. 1 (2015), pp. 245-288; arXiv preprint, arXiv:1310.8635 [math.NT], 2013-2014.
Eric Rowland, Reem Yassawi and Christian Krattenthaler, Lucas congruences for the Apéry numbers modulo p^2, arXiv:2005.04801 [math.NT], 2020.
Andrew Strangeway, A Reconstruction Theorem for Quantum Cohomology of Fano Bundles on Projective Space, arXiv preprint arXiv:1302.5089 [math.AG], 2013.
Andrew Strangeway, Quantum reconstruction for Fano bundles on projective space, Nagoya Math. J., Vol. 218 (2015), pp. 1-28.
Armin Straub, Multivariate Apéry numbers and supercongruences of rational functions, Algebra & Number Theory, Vol. 8, No. 8 (2014), pp. 1985-2008; arXiv preprint, arXiv:1401.0854 [math.NT], 2014.
Volker Strehl, Recurrences and Legendre transform, Séminaire Lotharingien de Combinatoire, B29b (1992), 22 pp.
Volker Strehl, Binomial identities -- combinatorial and algorithmic aspects, Discrete Mathematics, Vol. 136 (1994), 309-346.
Zhi-Hong Sun, Congruences for Apéry-like numbers, arXiv:1803.10051 [math.NT], 2018.
Zhi-Hong Sun, New congruences involving Apéry-like numbers, arXiv:2004.07172 [math.NT], 2020.
Zhi-Wei Sun, Congruences for Franel numbers, arXiv preprint arXiv:1112.1034 [math.NT], 2011.
Zhi-Wei Sun, On sums of Apéry polynomials and related congruences, J. Number Theory 132(2012), 2673-2699. [_Zhi-Wei Sun_, Mar 21 2013]
Zhi-Wei Sun. Sun, On sums of Apéry polynomials and related congruences, arXiv:1101.1946 [math.NT], 2011-2014. [_Zhi-Wei Sun_, Mar 21 2013]
Alfred van der Poorten, A proof that Euler missed ..., Math. Intelligencer, Vol. 1, No. 4 (December 1979), pp. 196-203, (b_n) after eq. (1.2), and Exercise 3.
Chen Wang, Two congruences concerning Apéry numbers, arXiv:1909.08983 [math.NT], 2019.
Eric Weisstein's World of Mathematics, Apéry Number.
Eric Weisstein's World of Mathematics, Strehl Identities.
Eric Weisstein's World of Mathematics, Schmidt's Problem.
Ernest X. W. Xia and Olivia X. M. Yao, A Criterion for the Log-Convexity of Combinatorial Sequences, The Electronic Journal of Combinatorics, Vol. 20 (2013), #P3.

Apéry's number or Apéry's constant zeta(3) is A002117. - N. J. A. Sloane, Jul 11 2023
Cf. A002736, A005258, A005429, A005430, A059415, A059416, A063007, A000172.
Cf. A006221, A000578, A006353.
Related to diagonal of rational functions: A268545-A268555.
The Apéry-like numbers [or Apéry-like sequences, Apery-like numbers, Apery-like sequences] include A000172, A000984, A002893, A002895, A005258, A005259, A005260, A006077, A036917, A063007, A081085, A093388, A125143 (apart from signs), A143003, A143007, A143413, A143414, A143415, A143583, A183204, A214262, A219692,A226535, A227216, A227454, A229111 (apart from signs), A260667, A260832, A262177, A264541, A264542, A279619, A290575, A290576. (The term "Apery-like" is not well-defined.)
For primes that do not divide the terms of the sequences A000172, A005258, A002893, A081085, A006077, A093388, A125143, A229111, A002895, A290575, A290576, A005259 see A260793, A291275-A291284 and A133370 respectively.
Cf. A092826 (prime terms).

List([0..20],n->Sum([0..n],k->Binomial(n,k)^2*Binomial(n+k,k)^2)); # Muniru A Asiru, Sep 28 2018

a005259 n = a005259_list !! n
a005259_list = 1 : 5 : zipWith div (zipWith (-)
   (tail $ zipWith (*) a006221_list a005259_list)
   (zipWith (*) (tail a000578_list) a005259_list)) (drop 2 a000578_list)
-- Reinhard Zumkeller, Mar 13 2014

[&+[Binomial(n, k) ^2 *Binomial(n+k, k)^2: k in [0..n]]:n in  [0..17]]; // Marius A. Burtea, Jan 20 2020

a := proc(n) option remember; if n=0 then 1 elif n=1 then 5 else (n^(-3))* ( (34*(n-1)^3 + 51*(n-1)^2 + 27*(n-1) +5)*a((n-1)) - (n-1)^3*a((n-1)-1)); fi; end;
# Alternative:
a := n -> hypergeom([-n, -n, 1+n, 1+n], [1, 1, 1], 1):
seq(simplify(a(n)), n=0..17); # Peter Luschny, Jan 19 2020

Table[HypergeometricPFQ[{-n, -n, n+1, n+1}, {1,1,1}, 1],{n,0,13}] (* Jean-François Alcover, Apr 01 2011 *)
Table[Sum[(Binomial[n,k]Binomial[n+k,k])^2,{k,0,n}],{n,0,30}] (* Harvey P. Dale, Oct 15 2011 *)
a[ n_] := SeriesCoefficient[ SeriesCoefficient[ SeriesCoefficient[ SeriesCoefficient[ 1 / (1 - t (1 + x ) (1 + y ) (1 + z ) (x y z + (y + 1) (z + 1))), {t, 0, n}], {x, 0, n}], {y, 0, n}], {z, 0, n}]; (* Michael Somos, May 14 2016 *)

a(n)=sum(k=0,n,(binomial(n,k)*binomial(n+k,k))^2) \\ Charles R Greathouse IV, Nov 20 2012

def A005259(n):
    m, g = 1, 0
    for k in range(n+1):
        g += m
        m *= ((n+k+1)*(n-k))**2
        m //=(k+1)**4
    return g # Chai Wah Wu, Oct 02 2022

D-finite with recurrence (n+1)^3*a(n+1) = (34*n^3 + 51*n^2 + 27*n + 5)*a(n) - n^3*a(n-1), n >= 1.
Representation as a special value of the hypergeometric function 4F3, in Maple notation: a(n)=hypergeom([n+1, n+1, -n, -n], [1, 1, 1], 1), n=0, 1, ... - Karol A. Penson Jul 24 2002
a(n) = Sum_{k >= 0} A063007(n, k)*A000172(k). A000172 = Franel numbers. - Philippe Deléham, Aug 14 2003
G.f.: (-1/2)*(3*x - 3 + (x^2-34*x+1)^(1/2))*(x+1)^(-2)*hypergeom([1/3,2/3],[1],(-1/2)*(x^2 - 7*x + 1)*(x+1)^(-3)*(x^2 - 34*x + 1)^(1/2)+(1/2)*(x^3 + 30*x^2 - 24*x + 1)*(x+1)^(-3))^2. - Mark van Hoeij, Oct 29 2011
Let g(x, y) = 4*cos(2*x) + 8*sin(y)*cos(x) + 5 and let P(n,z) denote the Legendre polynomial of degree n. Then G. A. Edgar posted a conjecture of Alexandru Lupas that a(n) equals the double integral 1/(4*Pi^2)*int {y = -Pi..Pi} int {x = -Pi..Pi} P(n,g(x,y)) dx dy. (Added Jan 07 2015: Answered affirmatively in Math Overflow question 178790) - Peter Bala, Mar 04 2012; edited by G. A. Edgar, Dec 10 2016
a(n) ~ (1+sqrt(2))^(4*n+2)/(2^(9/4)*Pi^(3/2)*n^(3/2)). - Vaclav Kotesovec, Nov 01 2012
a(n) = Sum_{k=0..n} C(n,k)^2 * C(n+k,k)^2. - Joerg Arndt, May 11 2013
0 = (-x^2+34*x^3-x^4)*y''' + (-3*x+153*x^2-6*x^3)*y'' + (-1+112*x-7*x^2)*y' + (5-x)*y, where y is g.f. - Gheorghe Coserea, Jul 14 2016
From Peter Bala, Jan 18 2020: (Start)
a(n) = Sum_{0 <= j, k <= n} (-1)^(n+j) * C(n,k)^2 * C(n+k,k)^2 * C(n,j) * C(n+k+j,k+j).
a(n) = Sum_{0 <= j, k <= n} C(n,k) * C(n+k,k) * C(k,j)^3 (see Koepf, p. 55).
a(n) = Sum_{0 <= j, k <= n} C(n,k)^2 * C(n,j)^2 * C(3*n-j-k,2*n) (see Koepf, p. 119).
Diagonal coefficients of the rational function 1/((1 - x - y)*(1 - z - t) - x*y*z*t) (Straub, 2014). (End)
a(n) = [x^n] 1/(1 - x)*( Legendre_P(n,(1 + x)/(1 - x)) )^m at m = 2. At m = 1 we get the Apéry numbers A005258. - Peter Bala, Dec 22 2020
a(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*A108625(n, k). - Peter Bala, Jul 18 2024
a(n) = Sum_{k=0..n} Sum_{j=0..n} C(n,k)^2 * C(n,j)^2 * C(k+j,k), see Labelle et al. link. - Max Alekseyev, Mar 12 2025

A005258 Apéry numbers: a(n) = Sum_{k=0..n} binomial(n,k)^2 * binomial(n+k,k).

Original entry on oeis.org

1, 3, 19, 147, 1251, 11253, 104959, 1004307, 9793891, 96918753, 970336269, 9807518757, 99912156111, 1024622952993, 10567623342519, 109527728400147, 1140076177397091, 11911997404064793, 124879633548031009, 1313106114867738897, 13844511065506477501

Offset: 0

N. J. A. Sloane

This is the Taylor expansion of a special point on a curve described by Beauville. - Matthijs Coster, Apr 28 2004
Equals the main diagonal of square array A108625. - Paul D. Hanna, Jun 14 2005
This sequence is t_5 in Cooper's paper. - Jason Kimberley, Nov 25 2012
Conjecture: For each n=1,2,3,... the polynomial a_n(x) = Sum_{k=0..n} C(n,k)^2*C(n+k,k)*x^k is irreducible over the field of rational numbers. - Zhi-Wei Sun, Mar 21 2013
Diagonal of rational functions 1/(1 - x - x*y - y*z - x*z - x*y*z), 1/(1 + y + z + x*y + y*z + x*z + x*y*z), 1/(1 - x - y - z + x*y + x*y*z), 1/(1 - x - y - z + y*z + x*z - x*y*z). - Gheorghe Coserea, Jul 07 2018

			G.f. = 1 + 3*x + 19*x^2 + 147*x^3 + 1251*x^4 + 11253*x^5 + 104959*x^6 + ...

Matthijs Coster, Over 6 families van krommen [On 6 families of curves], Master's Thesis (unpublished), Aug 26 1983.
S. Melczer, An Invitation to Analytic Combinatorics, 2021; p. 129.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Simon Plouffe, Table of n, a(n) for n = 0..954
B. Adamczewski, J. P. Bell, and E. Delaygue, Algebraic independence of G-functions and congruences "a la Lucas", arXiv preprint arXiv:1603.04187 [math.NT], 2016.
Roger Apéry, Irrationalité de zeta(2) et zeta(3), in Journées Arith. de Luminy. Colloque International du Centre National de la Recherche Scientifique (CNRS) held at the Centre Universitaire de Luminy, Luminy, Jun 20-24, 1978. Astérisque, 61 (1979), 11-13.
Roger Apéry, Sur certaines séries entières arithmétiques, Groupe de travail d'analyse ultramétrique, 9 no. 1 (1981-1982), Exp. No. 16, 2 p.
Thomas Baruchel and C. Elsner, On error sums formed by rational approximations with split denominators, arXiv preprint arXiv:1602.06445 [math.NT], 2016.
Arnaud Beauville, Les familles stables de courbes sur P_1 admettant quatre fibres singulières, Comptes Rendus, Académie Sciences Paris, no. 294, May 24 1982, page 657.
F. Beukers, Another congruence for the Apéry numbers, J. Number Theory 25 (1987), no. 2, 201-210.
A. Bostan, S. Boukraa, J.-M. Maillard, and J.-A. Weil, Diagonals of rational functions and selected differential Galois groups, arXiv preprint arXiv:1507.03227 [math-ph], 2015.
Francis Brown, Irrationality proofs for zeta values, moduli spaces and dinner parties, arXiv:1412.6508 [math.NT], 2014.
Shaun Cooper, Sporadic sequences, modular forms and new series for 1/pi, Ramanujan J. (2012).
Shaun Cooper, Apéry-like sequences defined by four-term recurrence relations, arXiv:2302.00757 [math.NT], 2023.
M. Coster, Email, Nov 1990
E. Delaygue, Arithmetic properties of Apéry-like numbers, arXiv preprint arXiv:1310.4131 [math.NT], 2013-2015.
E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory 117 (2006), 191-215.
C. Elsner, On recurrence formulas for sums involving binomial coefficients, Fib. Q., 43,1 (2005), 31-45.
C. Elsner, On prime-detecting sequences from Apéry's recurrence formulas for zeta(3) and zeta(2), JIS 11 (2008) 08.5.1.
Ofir Gorodetsky, New representations for all sporadic Apéry-like sequences, with applications to congruences, arXiv:2102.11839 [math.NT], 2021. See D p. 2.
R. K. Guy, Letter to N. J. A. Sloane, Oct 1985
S. Herfurtner, Elliptic surfaces with four singular fibres, Mathematische Annalen, 1991. Preprint.
Michael D. Hirschhorn, A Connection Between Pi and Phi, Fibonacci Quart. 53 (2015), no. 1, 42-47.
Lalit Jain and Pavlos Tzermias, Beukers' integrals and Apéry's recurrences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.1.
Bradley Klee, Checking Weierstrass data, 2023.
Vaclav Kotesovec, Asymptotic of generalized Apéry sequences with powers of binomial coefficients, Nov 04 2012.
Ji-Cai Liu, Supercongruences for the (p-1)th Apéry number, arXiv:1803.11442 [math.NT], 2018.
Amita Malik and Armin Straub, Divisibility properties of sporadic Apéry-like numbers, Research in Number Theory, 2016, 2:5.
R. Mestrovic, Lucas' theorem: its generalizations, extensions and applications (1878--2014), arXiv preprint arXiv:1409.3820 [math.NT], 2014.
Peter Paule and Carsten Schneider, Computer proofs of a new family of harmonic number identities, Advances in Applied Mathematics (31), 359-378, (2003).
Simon Plouffe, The first 2553 Apéry numbers
E. Rowland and R. Yassawi, Automatic congruences for diagonals of rational functions, arXiv preprint arXiv:1310.8635 [math.NT], 2013.
V. Strehl, Recurrences and Legendre transform, Séminaire Lotharingien de Combinatoire, B29b (1992), 22 pp.
Zhi-Hong Sun, Congruences for Apéry-like numbers, arXiv:1803.10051 [math.NT], 2018.
Zhi-Hong Sun, New congruences involving Apéry-like numbers, arXiv:2004.07172 [math.NT], 2020.
A. van der Poorten, A proof that Euler missed ... Apéry's proof of the irrationality of zeta(3). An informal report. Math. Intelligencer 1 (1978/79), no 4, 195-203.
Eric Weisstein's World of Mathematics, Apéry Number.
D. Zagier, Integral solutions of Apéry-like recurrence equations. See line D in sporadic solutions table of page 5.
W. Zudilin, Approximations to -, di- and tri-logarithms, arXiv:math/0409023 [math.CA], 2004-2005.

Cf. A002736, A005259, A005429, A005430, A108625, A143413, A218690, A218692.
Cf. A007318.
Cf. A001008, A002805.
The Apéry-like numbers [or Apéry-like sequences, Apery-like numbers, Apery-like sequences] include A000172, A000984, A002893, A002895, A005258, A005259, A005260, A006077, A036917, A063007, A081085, A093388, A125143 (apart from signs), A143003, A143007, A143413, A143414, A143415, A143583, A183204, A214262, A219692,A226535, A227216, A227454, A229111 (apart from signs), A260667, A260832, A262177, A264541, A264542, A279619, A290575, A290576. (The term "Apery-like" is not well-defined.)
For primes that do not divide the terms of the sequences A000172, A005258, A002893, A081085, A006077, A093388, A125143, A229111, A002895, A290575, A290576, A005259 see A260793, A291275-A291284 and A133370 respectively.

a:=n->Sum([0..n],k->(-1)^(n-k)*Binomial(n,k)*Binomial(n+k,k)^2);;
A005258:=List([0..20],n->a(n));; # Muniru A Asiru, Feb 11 2018

List([0..20],n->Sum([0..n],k->Binomial(n,k)^2*Binomial(n+k,k))); # Muniru A Asiru, Jul 29 2018

a005258 n = sum [a007318 n k ^ 2 * a007318 (n + k) k | k <- [0..n]]
-- Reinhard Zumkeller, Jan 04 2013

[&+[Binomial(n,k)^2 * Binomial(n+k,k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Nov 28 2018

with(combinat): seq(add((multinomial(n+k,n-k,k,k))*binomial(n,k), k=0..n), n=0..18); # Zerinvary Lajos, Oct 18 2006
a := n -> binomial(2*n, n)*hypergeom([-n, -n, -n], [1, -2*n], 1):
seq(simplify(a(n)), n=0..20); # Peter Luschny, Feb 10 2018

a[n_] := HypergeometricPFQ[ {n+1, -n, -n}, {1, 1}, 1]; Table[ a[n], {n, 0, 18}] (* Jean-François Alcover, Jan 20 2012, after Vladeta Jovovic *)
Table[Sum[Binomial[n,k]^2 Binomial[n+k,k],{k,0,n}],{n,0,20}] (* Harvey P. Dale, Aug 25 2019 *)

{a(n) = if( n<0, -(-1)^n * a(-1-n), sum(k=0, n, binomial(n, k)^2 * binomial(n+k, k)))} /* Michael Somos, Sep 18 2013 */

def A005258(n):
    m, g = 1, 0
    for k in range(n+1):
        g += m
        m *= (n+k+1)*(n-k)**2
        m //= (k+1)**3
    return g # Chai Wah Wu, Oct 02 2022

a(n) = hypergeom([n+1, -n, -n], [1, 1], 1). - Vladeta Jovovic, Apr 24 2003
D-finite with recurrence: (n+1)^2 * a(n+1) = (11*n^2+11*n+3) * a(n) + n^2 * a(n-1). - Matthijs Coster, Apr 28 2004
Let b(n) be the solution to the above recurrence with b(0) = 0, b(1) = 5. Then the b(n) are rational numbers with b(n)/a(n) -> zeta(2) very rapidly. The identity b(n)*a(n-1) - b(n-1)*a(n) = (-1)^(n-1)*5/n^2 leads to a series acceleration formula: zeta(2) = 5 * Sum_{n >= 1} 1/(n^2*a(n)*a(n-1)) = 5*(1/(1*3) + 1/(2^2*3*19) + 1/(3^2*19*147) + ...). Similar results hold for the constant e: see A143413. - Peter Bala, Aug 14 2008
G.f.: hypergeom([1/12, 5/12],[1], 1728*x^5*(1-11*x-x^2)/(1-12*x+14*x^2+12*x^3+x^4)^3) / (1-12*x+14*x^2+12*x^3+x^4)^(1/4). - Mark van Hoeij, Oct 25 2011
a(n) ~ ((11+5*sqrt(5))/2)^(n+1/2)/(2*Pi*5^(1/4)*n). - Vaclav Kotesovec, Oct 05 2012
1/Pi = 5*(sqrt(47)/7614)*Sum_{n>=0} (-1)^n a(n)*binomial(2n,n)*(682n+71)/15228^n. [Cooper, equation (4)] - Jason Kimberley, Nov 26 2012
a(-1 - n) = (-1)^n * a(n) if n>=0. a(-1 - n) = -(-1)^n * a(n) if n<0. - Michael Somos, Sep 18 2013
0 = a(n)*(a(n+1)*(+4*a(n+2) + 83*a(n+3) - 12*a(n+4)) + a(n+2)*(+32*a(n+2) + 902*a(n+3) - 147*a(n+4)) + a(n+3)*(-56*a(n+3) + 12*a(n+4))) + a(n+1)*(a(n+1)*(+17*a(n+2) + 374*a(n+3) - 56*a(n+4)) + a(n+2)*(+176*a(n+2) + 5324*a(n+3) - 902*a(n+4)) + a(n+3)*(-374*a(n+3) + 83*a(n+4))) + a(n+2)*(a(n+2)*(-5*a(n+2) - 176*a(n+3) + 32*a(n+4)) + a(n+3)*(+17*a(n+3) - 4*a(n+4))) for all n in Z. - Michael Somos, Aug 06 2016
a(n) = binomial(2*n, n)*hypergeom([-n, -n, -n],[1, -2*n], 1). - Peter Luschny, Feb 10 2018
a(n) = Sum_{k = 0..n} (-1)^(n-k)*binomial(n,k)*binomial(n+k,k)^2. - Peter Bala, Feb 10 2018
G.f. y=A(x) satisfies: 0 = x*(x^2 + 11*x - 1)*y'' + (3*x^2 + 22*x - 1)*y' + (x + 3)*y. - Gheorghe Coserea, Jul 01 2018
From Peter Bala, Jan 15 2020: (Start)
a(n) = Sum_{0 <= j, k <= n} (-1)^(j+k)*C(n,k)*C(n+k,k)^2*C(n,j)* C(n+k+j,k+j).
a(n) = Sum_{0 <= j, k <= n} (-1)^(n+j)*C(n,k)^2*C(n+k,k)*C(n,j)* C(n+k+j,k+j).
a(n) = Sum_{0 <= j, k <= n} (-1)^j*C(n,k)^2*C(n,j)*C(3*n-j-k,2*n). (End)
a(n) = [x^n] 1/(1 - x)*( Legendre_P(n,(1 + x)/(1 - x)) )^m at m = 1. At m = 2 we get the Apéry numbers A005259. - Peter Bala, Dec 22 2020
a(n) = (-1)^n*Sum_{j=0..n} (1 - 5*j*H(j) + 5*j*H(n - j))*binomial(n, j)^5, where H(n) denotes the n-th harmonic number, A001008/A002805. (Paule/Schneider). - Peter Luschny, Jul 23 2021
From Bradley Klee, Jun 05 2023: (Start)
The g.f. T(x) obeys a period-annihilating ODE:
0=(3 + x)*T(x) + (-1 + 22*x + 3*x^2)*T'(x) + x*(-1 + 11*x + x^2)*T''(x).
The periods ODE can be derived from the following Weierstrass data:
g2 = 3*(1 - 12*x + 14*x^2 + 12*x^3 + x^4);
g3 = 1 - 18*x + 75*x^2 + 75*x^4 + 18*x^5 + x^6;
which determine an elliptic surface with four singular fibers. (End)
Conjecture: a(n)^2 = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*A143007(n, k). - Peter Bala, Jul 08 2024

A005430 Apéry numbers: nC(2n,n).

Original entry on oeis.org

0, 2, 12, 60, 280, 1260, 5544, 24024, 102960, 437580, 1847560, 7759752, 32449872, 135207800, 561632400, 2326762800, 9617286240, 39671305740, 163352435400, 671560012200, 2756930576400, 11303415363240, 46290177201840, 189368906734800, 773942488394400

Offset: 0

Simon Plouffe

Appears as diagonal in A003506. - Zerinvary Lajos, Apr 12 2006
The aerated sequence 1,0,2,0,12,0,60,0,... has e.g.f. 1+x*Bessel_I(1,2x). - Paul Barry, Mar 29 2010
Conjecture: the terms of the inverse binomial transform are 2*A132894(n). - R. J. Mathar, Oct 21 2012

Frank Harary and Edgar M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 78, (3.5.25).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
Kunle Adegoke, Robert Frontczak, and Taras Goy, Fibonacci-Catalan Series, Integers: Electronic Journal of Combinatorial Number Theory, Vol. 22 (2022), #A110.
Laurent Alonso and Edward M. Reingold, Analysis of Boyer and Moore's MJRTY Algorithm, 2012.
T. Amdeberhan and Henri Cohen, Bernoulli sum meets golden number, MathOverflow, version of 2017-06-15.
Libor Caha and Daniel Nagaj, The pair-flip model: a very entangled translationally invariant spin chain, arXiv:1805.07168 [quant-ph], 2018.
Benjamin Ruoyu Kan, Polynomial Approximations for Quantum Hamiltonian Complexity, Bachelor's thesis, Harvard Univ., 2023.
Hans J. H. Tuenter, Walking into an absolute sum, arXiv:math/0606080 [math.NT], 2006. Published version on Walking into an absolute sum, The Fibonacci Quarterly, 40(2):175-180, May 2002.
Alfred J. van der Poorten, A proof that Euler missed ... Apery's proof of the irrationality of zeta(3), Math. Intelligencer 1 (1978/1979), 195-203.
I. J. Zucker, On the series Sum(k>=1) C(2k,k)^(-1)*k^(-n) and related sums, J. Number Theory, Vol. 20, No. 1 (1985), 92-102.
Wadim Zudilin, An elementary proof of Apery's theorem, arXiv:math/0202159 [math.NT], 2002.

Cf. A002011, A002457, A002736, A005258, A005259, A005429, 1/beta(n, n+1) in A061928.

Cf. A001803, A003506.

List([0..30], n-> n*Binomial(2*n,n)); # G. C. Greubel, Dec 09 2018

[n*Binomial(2*n,n): n in [0..30]]; // G. C. Greubel, Dec 09 2018

Maple
```
A005430 := n -> n*binomial(2*n, n);
```

Table[n*Binomial[2n,n],{n,0,30}] (* Harvey P. Dale, May 29 2015 *)

a(n)=-(-1)^n*real(polcoeff(serlaplace(x^2*besselh1(1,2*x)),2*n)) \\ Ralf Stephan

[n*binomial(2*n,n) for n in range(30)] # G. C. Greubel, Dec 09 2018

a(n) = A002011(n-1)/2 = 2 * A002457(n-1).
Sum_{n >= 1} 1/a(n) = Pi*sqrt(3)/9. - Benoit Cloitre, Apr 07 2002
G.f.:  2*x/sqrt((1-4*x)^3). - Marco A. Cisneros Guevara, Jul 25 2011
E.g.f.: a(n) = n!* [x^n] exp(2*x)*2*x*(BesselI(0, 2*x)+BesselI(1, 2*x)). - Peter Luschny, Aug 25 2012
D-finite with recurrence (-n+1)*a(n) + 2*(2*n-1)*a(n-1) = 0. - R. J. Mathar, Dec 03 2012
G.f.: 2*x*(1-4*x)^(-3/2) = -G(0)/2 where G(k) =  1 - (2*k+1)/(1 - 2*x/(2*x - (k+1)/G(k+1) )); (recursively defined continued fraction). - Sergei N. Gladkovskii, Dec 06 2012
a(n-1) = Sum_{k=0..floor(n/2)} k*C(n,k)*C(n-k,k)*2^(n-2*k). - Robert FERREOL, Aug 29 2015
From Ilya Gutkovskiy, Jan 17 2017: (Start)
a(n) ~ 4^n*sqrt(n)/sqrt(Pi).
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(phi)/sqrt(5) = A086466, where phi is the golden ratio. (End)
1/a(n) = (-1)^n*Sum_{j=0..n-1} binomial(n-1,j)*Bernoulli(j+n)/(j+n) for n >= 1. See the Amdeberhan & Cohen link. - Peter Luschny, Jun 20 2017
1/a(n) = Sum_{k=0..n} (-1)^(k+1)*binomial(n,k)*HarmonicNumber(n+k) for n >= 1. - Peter Luschny, Aug 15 2017
Sum_{n>=1} x^n/a(n) = 2*sqrt(x/(4-x))*arcsin(sqrt(x)/2), for abs(x) < 4 (Adegoke et al., 2022, section 6, p. 11). - Amiram Eldar, Dec 07 2024

More terms from James Sellers, May 01 2000

A002736 Apéry numbers: a(n) = n^2*C(2n,n).

Original entry on oeis.org

0, 2, 24, 180, 1120, 6300, 33264, 168168, 823680, 3938220, 18475600, 85357272, 389398464, 1757701400, 7862853600, 34901442000, 153876579840, 674412197580, 2940343837200, 12759640231800, 55138611528000, 237371722628040, 1018383898440480

Offset: 0

N. J. A. Sloane

Let H be the n X n Hilbert matrix H(i,j) = 1/(i+j-1) for 1 <= i,j <= n. Let B be the inverse matrix of H. The sum of the elements in row n-1 of B equals -a(n-1). - T. D. Noe, May 01 2011

J. Ser, Les Calculs Formels des Séries de Factorielles, Gauthier-Villars, Paris, 1933, p. 93.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
Kunle Adegoke, Robert Frontczak, and Taras Goy, Fibonacci-Catalan Series, Integers: Electronic Journal of Combinatorial Number Theory, Vol. 22 (2022), #A110.
Paul S. Bruckman, Problem B-871, Elementary Problems and Solutions, The Fibonacci Quarterly, Vol. 37, No. 1 (1999), p. 85.
J. Ser, Les Calculs Formels des Séries de Factorielles, Gauthier-Villars, Paris, 1933 [Local copy].
J. Ser, Les Calculs Formels des Séries de Factorielles, Gauthier-Villars, Paris, 1933 (Annotated scans of some selected pages).
Indulis Strazdins, Solution to problem B-871, Fibonacci Quartely, Vol. 38, No. 1 (2000), pp. 86-87.
Hans J. H. Tuenter, Walking into an absolute sum, arXiv:math/0606080 [math.NT], 2006. Published version on Walking into an absolute sum, The Fibonacci Quarterly, Vol. 40, No. 2 (May 2002), pp. 175-180.
Alfred J. van der Poorten, A proof that Euler missed ... Apery's proof of the irrationality of zeta(3), Math. Intelligencer, Vol. 1 (1978/1979), pp. 195-203.

Cf. A000108, A002544, A005258, A005259, A005429, A005430, A086467.

A diagonal of A331431.

[n^2*Binomial(2*n, n): n in [0..30]]; // Vincenzo Librandi, Aug 08 2014

seq(n^2*binomial(2*n,n), n=0..50); # Robert Israel, Aug 07 2014

CoefficientList[ Series[x (4 x + 2)/(1 - 4 x)^(5/2), {x, 0, 20}], x] (* Robert G. Wilson v, Aug 08 2011 *)
Table[n^2 Binomial[2n,n],{n,0,30}] (* Harvey P. Dale, Jun 21 2017 *)

combinat::catalan(n)*(n+1)*n^2 $ n = 0..36 // Zerinvary Lajos, Apr 17 2007

my(x='x+O('x^100)); concat(0, Vec(x*(4*x+2)/((1-4*x)^(5/2)))) \\ Altug Alkan, Mar 21 2016

a(n) = n^2*binomial(2*n, n); \\ Michel Marcus, Mar 21 2016

[n^2*(n+1)*catalan_number(n) for n in (0..30)] # G. C. Greubel, Mar 23 2022

G.f.: x*(4*x+2)/((1-4*x)^(5/2)). - Marco A. Cisneros Guevara, Jul 25 2011
Sum_{n>=1} 1/a(n) = Pi^2/18 (Euler). - Benoit Cloitre, Apr 07 2002
From Ilya Gutkovskiy, Jan 17 2017: (Start)
a(n) ~ 4^n*n^(3/2)/sqrt(Pi).
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(phi)^2 = A086467, where phi is the golden ratio. (End)
D-finite with recurrence: (-n+1)*a(n) +2*(n+4)*a(n-1) +4*(2*n-3)*a(n-2)=0. - R. J. Mathar, Jan 21 2020
a(n) = (2n)!/(Gamma(n))^2. - Diego Rattaggi, Mar 30 2020
a(n) = Sum_{k=0..2*n} binomial(2*n,k)*abs(n-k)^3 (Bruckman, 1999; Strazdins, 2000). - Amiram Eldar, Jan 12 2022
Sum_{n>=1} x^n/a(n) = 2*arcsin(sqrt(x)/2)^2, for abs(x) < 4 (Adegoke et al., 2022, section 5, p. 10). - Amiram Eldar, Dec 07 2024
From Peter Bala, Aug 02 2025: (Start)
For n >= 1,
a(n) = 2*n*(2*n-1)/(n-1)^2 * a(n-1) with a(1) = 2 and
1/a(n) = Sum_{k = 0..n} (-1)^(n+k+1) * binomial(n, k)*binomial(n+k, k)/(n+k)^2. (End)
a(n) = 2 * A002544(n-1) for n>=1. - Alois P. Heinz, Aug 03 2025

cp's OEIS Frontend

A005259 Apery (Apéry) numbers: Sum_{k=0..n} (binomial(n,k)*binomial(n+k,k))^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A005258 Apéry numbers: a(n) = Sum_{k=0..n} binomial(n,k)^2 * binomial(n+k,k).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A005430 Apéry numbers: n*C(2*n,n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A002736 Apéry numbers: a(n) = n^2*C(2n,n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

MuPAD

PARI

PARI

Sage

Formula

A119554 Binomial(binomial(2*n,n)*n^3,n).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

A005430 Apéry numbers: nC(2n,n).

A119554 Binomial(binomial(2n,n)n^3,n).

A131705 Phi(binomial(2n,n)n^3).