Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030517
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030517 Number of walks of length n between two vertices on a icosahedron at distance 1. +0
3
1, 2, 13, 52, 273, 1302, 6573, 32552, 163073, 813802, 4070573, 20345052, 101733073, 508626302, 2543170573, 12715657552, 63578483073 (list; graph; listen)
OFFSET

1,2

FORMULA

A030517(n)=2*A030517(n-1)+2*A030518(n-1)+5*A030517(n-2), A030518(n)=2*A030517(n-1)+2*A030518(n-1)+5*A030518(n-2)

a(n)=5^n/12-(-1)^n/12+(sqrt(5))^(n+1)/20+(-sqrt(5))^(n+1)/20. a(n)=4a(n-1)+10a(n-2)-20a(n-3)-25a(n-4) for n>=5. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 03 2004

CROSSREFS

Sequence in context: A056297 A037383 A034476 this_sequence A048502 A144235 A042061

Adjacent sequences: A030514 A030515 A030516 this_sequence A030518 A030519 A030520

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research