cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A266549 Number of 2n-step 2-dimensional closed self-avoiding paths on square lattice, reduced for symmetry, i.e., where rotations and reflections are not counted as distinct.

Original entry on oeis.org

0, 1, 1, 3, 6, 25, 86, 414, 1975, 10479, 56572, 316577, 1800363, 10419605, 61061169, 361978851
Offset: 1

Views

Author

Luca Petrone, Dec 31 2015

Keywords

Comments

Differs from A057730 beginning at n = 8, since that sequence includes polyominoes with holes.

Crossrefs

Apparently lim A002931(n)/a(n) = 8 for increasing n, accounting for (in most cases) 4 rotations times two flips. - Joerg Arndt, Hugo Pfoertner, Jul 09 2018
Cf. A010566, A037245 (open self-avoiding walks), A316194.

Extensions

a(11)-a(16) from Joerg Arndt, Jan 25 2018