|
Search: id:A095929
|
|
|
| A095929 |
|
Number of closed walks of length 2n at a vertex of the cyclic graph on 10 nodes C_10. |
|
+0
1
|
|
| 1, 2, 6, 20, 70, 254, 948, 3614, 13990, 54740, 215766, 854702, 3396916, 13530350, 53971350, 215492564, 860941798, 3441074654, 13757249460, 55010542910, 219993856006, 879848932052, 3519064567926, 14075391282830
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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=10 and k=0.
|
|
FORMULA
|
a(n)= 4^n/10*Sum_{r=0..9} Cos(Pi*r/5)^(2n); a(n)=7a(n-1)-13a(n-2)+4a(n-3); G.f.: (-1+5x-5x^2)/((-1+4x)(1-3x+x^2))
|
|
MATHEMATICA
|
f[n_]:=FullSimplify[TrigToExp[(4^n/10)Sum[Cos[Pi*k/5]^(2n), {k, 0, 9}]]]; Table[f[n], {n, 0, 35}]
|
|
CROSSREFS
|
Sequence in context: A119373 A151284 A049138 this_sequence A078482 A049128 A049140
Adjacent sequences: A095926 A095927 A095928 this_sequence A095930 A095931 A095932
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herbert Kociemba (kociemba(AT)t-online.de), Jul 12 2004
|
|
|
Search completed in 0.002 seconds
|
