cp's OEIS Frontend

A092375 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 three 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.

%I A092375 #10 Nov 16 2019 20:06:01
%S A092375 1,1,4707,17576,112088578,1441214058,17605459620761,743370332504726,
%T A092375 19997068111196867031,2689483333931146069897,
%U A092375 171415422163184300298223345,71911782152540818802247981150
%N A092375 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 three 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.
%H A092375 G. C. Greubel, <a href="/A092375/b092375.txt">Table of n, a(n) for n = 6..60</a>
%H A092375 Saibal Mitra and Bernard Nienhuis, <a href="https://dmtcs.episciences.org/3320">Osculating Random Walks on Cylinders</a>, in Discrete Random Walks, DRW'03, Cyril Banderier and Christian Krattenthaler (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AC, pp. 259-264.
%F A092375 Even n: Q(n, m) = Sum_{r=0..(n-2*m)/4} (-1)^r * ((m+2*r)/(m+r)) * binomial(m+r, r) * C_{n/2 - m - 2*r}(n).
%F A092375 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, 3).
%t A092375 M[n_, k_]:= Table[Binomial[i+j-2, i-1], {i, n}, {j, k}];
%t A092375 c[k_, n_]:= Coefficient[CharacteristicPolynomial[M[n, n], x], x, k]//Abs;
%t A092375 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}];
%t A092375 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}];
%t A092375 Table[Q[n, 3], {n, 6, 20}] (* _G. C. Greubel_, Nov 15 2019 *)
%Y A092375 Cf. A045912, A092372, A092373, A092374, A092376, A092377, A092378, A092379, A092380, A092381, A092382.
%K A092375 nonn
%O A092375 6,3
%A A092375 Saibal Mitra (smitra(AT)zonnet.nl), Mar 20 2004