This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002895 Domb numbers: number of 2n-step polygons on diamond lattice.
(Formerly M3626 N1473)
1, 4, 28, 256, 2716, 31504, 387136, 4951552, 65218204, 878536624, 12046924528, 167595457792, 2359613230144, 33557651538688, 481365424895488, 6956365106016256, 101181938814289564, 1480129751586116848, 21761706991570726096, 321401321741959062016 (list; graph; refs; listen; history; text; internal format)



a(n) is the (2n)th moment of the distance from the origin of a 4-step random walk in the plane - Peter M.W. Gill (peter.gill(AT)nott.ac.uk), Mar 03 2004

Row sums of the cube of A008459. - Peter Bala, Mar 05 2013

Conjecture: Let D(n) be the (n+1) X (n+1) Hankel-type determinant with (i,j)-entry equal to a(i+j) for all i,j = 0,...,n. Then the number D(n)/12^n is always a positive odd integer. - Zhi-Wei Sun, Aug 14 2013.


J. M. Borwein, A short walk can be beautiful, 2015; https://www.carma.newcastle.edu.au/jon/beauty.pdf

C. Domb, On the theory of cooperative phenomena in crystals, Advances in Phys., 9 (1960), 149-361.

J. A. Hendrickson, Jr., On the enumeration of rectangular (0,1)-matrices, Journal of Statistical Computation and Simulation, 51 (1995), 291-313.

Jonathan M. Borwein, Armin Straub and Christophe Vignat, Densities of short uniform random walks, Part II: Higher dimensions, Preprint, 2015; http://www.carma.newcastle.edu.au/jon/dwalks.pdf

Robert Osburn and Brundaban Sahu, A supercongruence for generalized Domb numbers, http://maths.ucd.ie/~osburn/superdomb.pdf.

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).

Armin Straub, Arithmetic aspects of random walks and methods in definite integration, Ph. D. Dissertation, School Of Science And Engineering, Tulane University, 2012.

Z.-W. Sun, Conjectures involving arithmetical sequences, Number Theory: Arithmetic in Shangrila (eds., S. Kanemitsu, H.-Z. Li and J.-Y. Liu), Proc. the 6th China-Japan Sem. Number Theory (Shanghai, August 15-17, 2011), World Sci., Singapore, 2013, pp. 244-258; http://math.nju.edu.cn/~zwsun/142p.pdf.


T. D. Noe, Table of n, a(n) for n = 0..100

David H. Bailey, Jonathan M. Borwein, David Broadhurst and M. L. Glasser, Elliptic integral evaluations of Bessel moments, arXiv:0801.0891.

Jonathan M. Borwein and Armin Straub, Mahler measures, short walks and log-sine integrals (2012).

Jonathan M. Borwein, Dirk Nuyens, Armin Straub and James Wan, Random Walk Integrals, 2010.

E. Delaygue, Arithmetic properties of Apery-like numbers, arXiv preprint arXiv:1310.4131, 2013

H. Huat Chan, Song Heng Chan, Zhiguo Liu, Domb's numbers and Ramanujan-Sato type series for 1/pi, Adv. Math. 186 (2004) 396.

L. B. Richmond, J. Shallit, Counting Abelian Squares, arXiv:0807.5028 [Math.CO]. [From R. J. Mathar, Oct 30 2008]

Yi Wang and Bao-Xuan Zhu, Proofs of some conjectures on monotonicity of number-theoretic and combinatorial sequences, arXiv preprint arXiv:1303.5595, 2013

Bao-Xuan Zhu, Higher order log-monotonicity of combinatorial sequences, arXiv preprint arXiv:1309.6025, 2013


Sum_{k=0..n} binomial(n, k)^2 * binomial(2n-2k, n-k) * binomial(2k, k).

n^3*a(n) = 2*(2*n-1)*(5*n^2-5*n+2)*a(n-1)-64*(n-1)^3*a(n-2). - Vladeta Jovovic, Jul 16 2004

Sum_{n>=0} a(n)*x^n/n!^2 = BesselI(0, 2*sqrt(x))^4. - Vladeta Jovovic, Aug 01 2006

G.f.: hypergeom([1/6, 1/3],[1],108*x^2/(1-4*x)^3)^2/(1-4*x)   - Mark van Hoeij, Oct 29 2011.

From Zhi-Wei Sun, Mar 20 2013: (Start)

Via the Zeilberger algorithm, Zhi-Wei Sun proved that

(1) sum_{k=0}^n (binomial(2k,k)*binomial(2(n-k),n-k))^3/binomial(n,k)^2 = 4^n*a(n),

(2) sum_{k=0}^n (-1)^(n-k)*binomial(n,k)*binomial(2k,n)*binomial(2k,k)*binomial(2(n-k),n-k) = a(n). (End)

a(n) ~ 2^(4*n+1)/((Pi*n)^(3/2)). - Vaclav Kotesovec, Aug 20 2013


Table[Sum[Binomial[n, k]^2 Binomial[2n-2k, n-k]Binomial[2k, k], {k, 0, n}], {n, 0, 30}] (* Harvey P. Dale, Aug 15 2011 *)

a[n_] = Binomial[2*n, n]*HypergeometricPFQ[{1/2, -n, -n, -n}, {1, 1, 1/2-n}, 1]; (* or *) a[n_] := SeriesCoefficient[BesselI[0, 2*Sqrt[x]]^4, {x, 0, n}]*n!^2; Table[a[n], {n, 0, 19}] (* Jean-François Alcover, Dec 30 2013, after Vladeta Jovovic *)

max = 19; Total /@ MatrixPower[Table[Binomial[n, k]^2, {n, 0, max}, {k, 0, max}], 3] (* Jean-François Alcover, Mar 24 2015, after Peter Bala *)


(PARI) C=binomial;

a(n) = sum(k=0, n, C(n, k)^2 * C(2*n-2*k, n-k) * C(2*k, k) );

/* Joerg Arndt, Apr 19 2013 */


Cf. A002893, A169714, A169715, A228289.

Sequence in context: A230640 A191801 A064340 * A141004 A217806 A152410

Adjacent sequences:  A002892 A002893 A002894 * A002896 A002897 A002898




N. J. A. Sloane.


More terms from Vladeta Jovovic, Mar 11 2003



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 30 12:08 EST 2015. Contains 264668 sequences.