Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091000 Number of closed walks of length n on the Petersen graph. +0
4
1, 0, 3, 0, 15, 12, 99, 168, 759, 1764, 6315, 16896, 54783, 156156, 484851, 1421784, 4330887, 12861588, 38846907, 116016432, 349097871, 1045196460, 3139783683, 9410962440, 28249664535, 84715439172, 254213426379, 762506061408 (list; graph; listen)
OFFSET

0,3

COMMENT

3^n=a(n)+3*A091001(n)+6*A091002(n)

FORMULA

G.f.: (1-2x-2x^2)((1-x)(1+2x)(1-3x)); a(n)=3^n/10+2(-2)^n/5+1/2.

a(n)=(A000244(n)+9*A001045(n+1)(-1)^n+6*A001045(n)(-1)^(n+1))/10.

CROSSREFS

Sequence in context: A130637 A054882 A086479 this_sequence A013490 A013351 A013407

Adjacent sequences: A090997 A090998 A090999 this_sequence A091001 A091002 A091003

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 12 2003

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 December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research