The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092376 The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by four loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices. 11
 1, 1, 66197, 250952, 18952950999, 253708881459, 32572923537006164, 1470573601262677388, 380591600530893567736185, 56147188534659327496920501, 32148338107501290909364945321743 (list; graph; refs; listen; history; text; internal format)
 OFFSET 8,3 LINKS G. C. Greubel, Table of n, a(n) for n = 8..60 Saibal Mitra and Bernard Nienhuis, Osculating Random Walks on Cylinders, in Discrete Random Walks, DRW'03, Cyril Banderier and Christian Krattenthaler (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AC, pp. 259-264. FORMULA Even n: Q(n, m) = C_{n/2-m}(n) + Sum_{r=1..(n-2*m)/4} (-1)^r * ((m+2*r)/(m+r)) * binomial(m+r, r) * C_{n/2 - m - 2*r}(n). Odd n: Q(n, m) = Sum_{r=0..(n-2*m-1)/4)} (-1)^r * binomial(m+r,r) * ( C_{(n-1)/2 - m - 2*r}(n) - C_{(n-1)/2 - m - 2*r - 1}(n) ), where the c_{k}(n) are the absolute values of the coefficients of the characteristic polynomial of the n X n Pascal matrix P_{i, j} = binomial(i+j-2, i-1). The sequence is given by Q(n, 4). MATHEMATICA M[n_, k_]:= Table[Binomial[i+j-2, i-1], {i, n}, {j, k}]; c[k_, n_]:= Coefficient[CharacteristicPolynomial[M[n, n], x], x, k]//Abs; Q[n_?EvenQ, m_]:= Sum[(-1)^r*((m+2*r)/(m+r))*Binomial[m +r, r]*c[n/2 -m-2*r, n], {r, 0, (n-2*m)/4}]; Q[n_?OddQ, m_]:= Sum[(-1)^r*Binomial[m+r, r]*(c[(n-1)/2 -m-2*r, n] - c[(n-1)/2 -m-2*r-1, n]), {r, 0, (n-2*m-1)/4}]; Table[Q[n, 4], {n, 8, 26}] (* G. C. Greubel, Nov 15 2019 *) CROSSREFS Cf. A045912, A092372, A092373, A092374, A092375, A092377, A092378, A092379, A092380, A092381, A092382. Sequence in context: A241978 A212583 A156424 * A251333 A157620 A174757 Adjacent sequences: A092373 A092374 A092375 * A092377 A092378 A092379 KEYWORD nonn AUTHOR Saibal Mitra (smitra(AT)zonnet.nl), Mar 20 2004 STATUS approved

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

Last modified May 23 04:41 EDT 2024. Contains 372758 sequences. (Running on oeis4.)