Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054885
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054885 Number of walks of length n along the edges of an icosahedron between two opposite vertices. +0
1
0, 0, 0, 10, 40, 260, 1240, 6510, 32240, 162760, 812240, 4069010, 20337240, 101725260, 508587240, 2543131510, 12715462240, 63578287760, 317890462240, 1589457194010, 7947281087240, 39736429850260 (list; graph; listen)
OFFSET

0,4

FORMULA

G.f.: -1/12/(5*t-1)+5/12/(t+1)+(1/2)/(5*t^2-1). a(n)=(5^n+(-1)^n*5-3*(1+(-1)^n)*sqrt(5)^n)/12

CROSSREFS

{a(n)/5} for n>1 is A030518.

Sequence in context: A061991 A060580 A118266 this_sequence A000449 A027274 A012868

Adjacent sequences: A054882 A054883 A054884 this_sequence A054886 A054887 A054888

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


AT&T Labs Research