login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284869 Number of n-step 2-dimensional closed self-avoiding paths on triangular lattice, reduced for symmetry, i.e., where rotations and reflections are not counted as distinct. 11
0, 0, 1, 1, 1, 4, 5, 16, 37, 120, 344, 1175, 3807, 13224, 45645 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

Differs from A057729 beginning at n = 11, since that sequence includes triangular polyominoes with holes.

LINKS

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

Hugo Pfoertner, Illustration of ratio A036418(n)/a(n) using Plot2.

Hugo Pfoertner, Illustration of polygons of perimeter <= 11.

CROSSREFS

Approaches (1/12)*A036418 for increasing n.

Cf. A057729, A258206, A266549, A316196.

Sequence in context: A196021 A064294 A352156 * A057729 A110278 A013628

Adjacent sequences: A284866 A284867 A284868 * A284870 A284871 A284872

KEYWORD

nonn,walk,more

AUTHOR

Luca Petrone, Apr 04 2017

EXTENSIONS

a(15) from Hugo Pfoertner, Jun 27 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 13:18 EST 2022. Contains 358430 sequences. (Running on oeis4.)