Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054883
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054883 Number of walks of length n along the edges of a dodecahedron between two opposite vertices. +0
1
0, 0, 0, 0, 0, 6, 12, 84, 192, 882, 2220, 8448, 22704, 78078, 218988, 710892, 2048256, 6430794, 18837516, 58008216, 171619248, 522598230, 1555243404, 4705481220, 14051590080, 42357719586, 126740502252, 381253030704 (list; graph; listen)
OFFSET

0,6

FORMULA

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

CROSSREFS

Sequence in context: A107904 A071930 A061520 this_sequence A005402 A128953 A002898

Adjacent sequences: A054880 A054881 A054882 this_sequence A054884 A054885 A054886

KEYWORD

nonn

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research