Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054881
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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; listen)
OFFSET

0,3

FORMULA

G.f.: 1/2+1/3/(1+2*t)-1/6/(4*t-1). a(n)=(4^n+(-1)^n*2^(n+1))/6 for n>0

CROSSREFS

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

Sequence in context: A002470 A087261 A078236 this_sequence A076687 A045882 A051681

Adjacent sequences: A054878 A054879 A054880 this_sequence A054882 A054883 A054884

KEYWORD

nonn,walk

AUTHOR

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

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research