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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110935 a(n) = if n mod 2 = 0 then 8*F(n)-n otherwise 8*F(n)-4, where F() = Fibonacci numbers A000045. 1
0, 4, 6, 12, 20, 36, 58, 100, 160, 268, 430, 708, 1140, 1860, 3002, 4876, 7880, 12772, 20654, 33444, 54100, 87564, 141666, 229252, 370920, 600196, 971118, 1571340, 2542460, 4113828, 6656290, 10770148, 17426440, 28196620, 45623062, 73819716, 119442780, 193262532 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Number of self-avoiding walks on the strip {0,1} X Z.

Variant of A038577. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008]

REFERENCES

A. T. Benjamin, Self-avoiding walks and Fibonacci numbers, Fib. Quart., 44 (No. 4, 2006), 330-334.

CROSSREFS

Sequence in context: A119638 A178547 A168674 * A128034 A027150 A020141

Adjacent sequences:  A110932 A110933 A110934 * A110936 A110937 A110938

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 30 2007

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 08:20 EST 2012. Contains 205729 sequences.