login
This site is supported by donations to The OEIS Foundation.
Logo

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. 0
1, 1, 66197, 250952, 18952950999, 253708881459, 32572923537006164, 1470573601262677388, 380591600530893567736185, 56147188534659327496920501, 32148338107501290909364945321743 (list; graph; refs; listen; history; internal format)
OFFSET

8,3

REFERENCES

Saibal Mitra and Bernard Nienhuis (2003), 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.

LINKS

Saibal Mitra and Bernard Nienhuis, Osculating Random Walks on Cylinders

FORMULA

Even n: Q(n, m)=C_{L/2-m}(n)+sum_{r=1}^{n/4-m/2}(-1)^{r}C_{n/2-m- 2r}(n)(frac{m+2r}{m+r}binom{m+r}{r}. Odd n: Q(n, m)=sum_{r=0}^{frac{(n-1)}{4}-frac{m}{2}}(-1)^{r}[C_{frac{(n-1)}{2}-m-2r}(n)-C_{frac{(n-1)}{2}-m-2r-1} (n)]binom{m+r}{r} 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}=Binom{i+j-2}{i-1}. The sequence is given by Q(n, 4)

CROSSREFS

Sequence in context: A032781 A170799 A156424 * A157620 A174757 A164129

Adjacent sequences:  A092373 A092374 A092375 * A092377 A092378 A092379

KEYWORD

nonn

AUTHOR

Saibal Mitra (smitra(AT)zonnet.nl), Mar 20 2004

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

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

Last modified February 15 16:56 EST 2012. Contains 205825 sequences.