OFFSET
1,5
COMMENTS
Bennett-Wood et al. (1998) used the notation p_n(k) "for the numbers of SAPs of length n with k-nearest-neighbour contacts" and they calculated them up to n=42. (Here, SAP = self-avoiding polygon.) In Table A1 of their paper (pp. 4736-4737), they calculate p_n(k) for n = 4,6,..., 40, 42 (even only) and all possible k's. It turns out that for the current sequence a(m) = p_{2*m}(k=0) for m >= 1. (Thus, Table B1 of Bennett-Wood et al. (1998) has no entries for p_n(k) when n is odd.) - Petros Hadjicostas, Jan 05 2019
LINKS
I. Jensen, Table of n, a(n) for n = 1..43 (from link below)
D. Bennett-Wood, I. G. Enting, D. S. Gaunt, A. J. Guttmann, J. L. Leask, A. L. Owczarek, and S. G. Whittington, Exact enumeration study of free energies of interacting polygons and walks in two dimensions, J. Phys. A: Math. Gen. 31 (1998), 4725-4741.
I. Jensen, More terms [Archived link, first column has the perimeter (4, 6, 8, ...)]
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 30 2006
STATUS
approved