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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046171 Number of inequivalent self-avoiding walks of length n on a 2-D lattice which start at origin, take first step in {+1,0} direction and if any steps are vertical, a step up is taken before a step down. 2
1, 2, 5, 13, 36, 98, 272, 740, 2034, 5513, 15037, 40617, 110188, 296806, 802075, 2155667, 5808335, 15582342, 41889578, 112212146, 301100754, 805570061, 2158326727, 5768299665, 15435169364, 41214098278, 110164686454 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n) = (A001411(n)+4)/8

CROSSREFS

Cf. A046170.

Sequence in context: A148293 A148294 A148295 * A022854 A116409 A002844

Adjacent sequences:  A046168 A046169 A046170 * A046172 A046173 A046174

KEYWORD

nonn,walk,easy,nice

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

EXTENSIONS

More terms from Stephen A. Silver (maths(AT)argentum.freeserve.co.uk)

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 05:45 EST 2012. Contains 205694 sequences.