A334398 Number of endless self-avoiding walks of length n for the square lattice up to rotation, reflection, and path reversal.

1, 2, 3, 7, 16, 39, 96, 245, 631, 1642

Offset

1,2

Comments

a(n) > A334322(n)/16.

Links

Table of n, a(n) for n=1..10.

Nathan Clisby, Endless self-avoiding walks, arXiv:1302.2796 [cond-mat.stat-mech], 2013.

Code Golf Stack Exchange, Infinite Snake game

Example

The a(4) = 7 step patterns of length 4 are
---->---->---->---->, ---->---->---->, ---->---->     ,
                                    |           |
                                    v           v---->
---->---->, ---->    ^, ---->     , and ---->     .
         |      |    |      |               |
         v      v---->      v---->          v
         |                       |          |
         v                       v          v---->

Crossrefs

Cf. A334322.

Sequence in context: A235112 A081207 A353580 * A027118 A114582 A352816

Adjacent sequences: A334395 A334396 A334397 * A334399 A334400 A334401

Keyword

nonn,walk,more

Author

Peter Kagey and Arnauld Chevallier, Apr 26 2020

Status

approved