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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054881 Number of walks of length n along the edges of an octahedron starting and ending at a vertex and also ( with a(0)=0 ) between two opposite vertices. 4
1, 0, 4, 8, 48, 160, 704, 2688, 11008, 43520, 175104, 698368, 2797568, 11182080, 44744704, 178946048, 715849728, 2863267840, 11453333504, 45812809728, 183252287488, 733007052800, 2932032405504, 11728121233408 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = (4^n+(-1)^n*2^(n+1))/6 for n>0

G.f.: 1/2+1/3/(1+2*x)+1/6/(1-4*x).

CROSSREFS

{a(n)/4} for k>0 is A003683.

Sequence in context: A002470 A087261 A078236 * A076687 A045882 A051681

Adjacent sequences:  A054878 A054879 A054880 * A054882 A054883 A054884

KEYWORD

nonn,walk

AUTHOR

Paolo Dominici (pl.dm(AT)libero.it), May 23 2000

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 14 05:53 EST 2012. Contains 205570 sequences.