|
Search: id:A095307
|
|
|
| A095307 |
|
Number of walks of length n between two nodes at distance 2 in the cycle graph C_7. |
|
+0
2
|
|
| 1, 0, 4, 1, 15, 7, 56, 37, 210, 176, 793, 793, 3017, 3458, 11561, 14756, 44592, 62017, 172995, 257775, 674520, 1062601, 2641366, 4352660, 10381281, 17742621, 40927033, 72048354, 161766061, 291693136, 640758252, 1178135905, 2542557383
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
COMMENT
|
In general 2^n/m*Sum(r,0,m-1,Cos(2Pi*k*r/m)Cos(2Pi*r/m)^n) is the number of walks of length n between two nodes at distance k in the cycle graph C_m. Here we have m=7 and k=2.
|
|
FORMULA
|
a(n)= 2^n/7*Sum(r, 0, 6, Cos(4Pi*r/7)Cos(2Pi*r/7)^n) G.f.: (1-x)x^2/((-1+2x)(-1-x+2x^2+x^3)) a(n)=a(n-1)+4a(n-2)-3a(n-3)-2a(n-4)
|
|
CROSSREFS
|
Sequence in context: A016115 A107873 A080419 this_sequence A124029 A056920 A123382
Adjacent sequences: A095304 A095305 A095306 this_sequence A095308 A095309 A095310
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herbert Kociemba (kociemba(AT)t-online.de), Jul 03 2004
|
|
|
Search completed in 0.002 seconds
|
