Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034165
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034165 Number of 'zig-zag' self-avoiding walks on an n X n lattice from a corner to opposite one. +0
2
1, 2, 2, 4, 10, 36, 188, 1582, 20576, 388592, 10461898 (list; graph; listen)
OFFSET

1,2

COMMENT

A 'zig-zag' walk does not contain 2 consecutive steps in the same direction.

LINKS

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

EXAMPLE

a(4)=4 because of the following paths:

A._......A......A.._.......A_

...|_....|_.....|_|.|_......_|

.....|_....|_........_|....|_..._

.......|.....|_.....|_.......|_|.|

.......B.......B......B..........B

CROSSREFS

Cf. A034166.

Sequence in context: A002420 A112556 A054100 this_sequence A006181 A092635 A067920

Adjacent sequences: A034162 A034163 A034164 this_sequence A034166 A034167 A034168

KEYWORD

nonn,walk

AUTHOR

Felice Russo (felice.russo(AT)katamail.com)

EXTENSIONS

a(7) to a(11) computed by David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research