Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038579 Number of self-avoiding closed walks from 0 of area n in strip Z X {0,1,2}. +0
1
1, 4, 10, 28, 64, 140, 304, 640, 1326, 2716, 5502, 11052, 22044, 43700, 86180, 169184, 330810, 644564, 1251954, 2424860, 4684696, 9029756, 17368408, 33343520, 63899686, 122259372, 233568998, 445600236, 849014964, 1615709156, 3071307852 (list; graph; listen)
OFFSET

0,2

REFERENCES

J. Labelle, Self-avoiding walks and polyominoes in strips, Bull. ICA, 23 (1998), 88-98.

FORMULA

G.f.= 2(1+2x^3+2x^4)/(1-x-x^2-x^3)^2-1 [Labelle] - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

CROSSREFS

Cf. A022445, A038578.

Sequence in context: A032248 A092504 A034920 this_sequence A133726 A026534 A111308

Adjacent sequences: A038576 A038577 A038578 this_sequence A038580 A038581 A038582

KEYWORD

nonn,walk,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research