login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271674 Number of n-step excursions on the 11-dimensional f.c.c. lattice. 8
1, 0, 220, 7920, 548460, 42276960, 3818372800, 385303564800, 42556023409900, 5056698223684800, 638162986199119920, 84683717201322993600, 11723112517163129913600, 1682392957299926013542400, 249030549709148521993536000, 37864267170542400351711467520 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) = number of walks in the integer lattice Z^11 starting and ending at the origin, using only the steps of the form (s_1, ..., s_11) with s_1^2 + ... + s_11^2 = 2, i.e., each possible step has precisely two nonzero entries which can be +1 or -1.

LINKS

Christoph Koutschan, Table of n, a(n) for n = 0..433

S. Hassani, C. Koutschan, J-M. Maillard, N. Zenine, Lattice Green Functions: the d-dimensional face-centred cubic lattice, d = 8, 9, 10, 11, 12, arXiv:1601.05657 [math-ph], 2016.

S. Hassani, C. Koutschan, J-M. Maillard, N. Zenine, Lattice Green functions: the d-dimensional face-centred cubic lattice, d = 8, 9, 10, 11, 12, Journal of Physics A: Mathematical and Theoretical 49(16) (2016), 164003.

C. Koutschan, Computations for higher-dimensional fcc lattices.

C. Koutschan, Differential operator annihilating the generating function.

FORMULA

The probability generating function P(z) = Sum_{n>=0} a(n)*(z/220)^n is given by the 11-fold integral (1/Pi)^11 Int_{0..Pi} ... Int_{0..Pi} 1/(1-z*lambda_11) dk_1 ... dk_11, where the structure function is defined as lambda_11 = (1/binomial(11,2)) Sum_{i=1..11} Sum_{j=(i+1)..11} cos(k_i)*cos(k_j). The function P(z) conjecturally satisfies a linear ODE of order 27 with polynomial coefficients of degree 409 (see link above).

Hence a(n) conjecturally satisfies a linear recurrence equation with polynomial coefficients.

EXAMPLE

There is one walk with no steps.

No walk with a single steps returns to the origin.

The number of returning walks with two steps is exactly the number of allowed steps (called the coordination number of the lattice): a(2) = 4*binomial(11,2).

MAPLE

nmax := 50: tt := [seq([seq(add(binomial(2*p, p)*binomial(2*j, 2*p-n)*binomial(2*n+2*j-2*p, n+j-p), p = floor((n+1)/2)..floor((n+2*j)/2)), j = 0..floor((nmax-n)/2))], n = 0..nmax)]: for d1 from 3 to 11 do tt := [seq([seq(add(binomial(n, p)*add(binomial(2*j, 2*q-p)*binomial(2*j+2*p-2*q, j+p-q)*tt[n-p+1, q+1], q = floor((p+1)/2)..floor((p+2*j)/2)), p = 0..n), j = 0..floor((nmax-n)/2))], n = 0..nmax)]: od: [seq(tt[n+1, 1], n = 0..nmax)];

MATHEMATICA

nmax = 50; T = Table[Sum[Binomial[2 p, p]*Binomial[2 j, 2 p - n]*Binomial[2 n + 2 j - 2 p, n + j - p], {p, Floor[(n + 1)/2], Floor[(n + 2 j)/2]}], {n, 0, nmax}, {j, 0, Floor[(nmax - n)/2]}]; Do[T = Table[Sum[Binomial[n, p]*Sum[Binomial[2 j, 2 q - p]*Binomial[2 j + 2 p - 2 q, j + p - q]*T[[n - p + 1, q + 1]], {q, Floor[(p + 1)/2], Floor[(p + 2 j)/2]}], {p, 0, n}], {n, 0, nmax}, {j, 0, If[d1 < 11, Floor[(nmax - n)/2], 0]}], {d1, 3, 11}]; First /@ T

CROSSREFS

Cf. A002899 (d = 3, i.e., excursions on the 3-dimensional f.c.c. lattice), A271432 (d = 4), A271650 (d = 5), A271651 (d = 6), A271670 (d = 7), A271671 (d = 8), A271672 (d = 9), A271673 (d = 10), this sequence (d = 11).

Sequence in context: A333139 A022042 A095702 * A107506 A140918 A049023

Adjacent sequences:  A271671 A271672 A271673 * A271675 A271676 A271677

KEYWORD

nonn,walk

AUTHOR

Christoph Koutschan, Apr 12 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 05:12 EST 2021. Contains 349419 sequences. (Running on oeis4.)