login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094052 Number of walks of length n between two adjacent nodes in the cycle graph C_7. 0
0, 1, 0, 3, 0, 10, 1, 35, 9, 126, 55, 462, 286, 1717, 1365, 6451, 6188, 24463, 27132, 93518, 116281, 360031, 490337, 1394582, 2043275, 5430530, 8439210, 21242341, 34621041, 83411715, 141290436, 328589491, 574274008, 1297937234, 2326683921 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

In general, a(n,m) = 2^n/m*Sum_{k=0..m-1} cos(2*Pi*k/m)^(n+1) counts walks of length n between two adjacent nodes in the cycle graph C_m.

LINKS

Table of n, a(n) for n=0..34.

FORMULA

a(n) = 2^n/7*Sum_{k=0..6} cos(2*Pi*k/7)^(n+1).

G.f.: x(1-x-x^2) / ((1-2x)(1+x-2x^2-x^3)).

MATHEMATICA

f[n_] := FullSimplify[ TrigToExp[ 2^n/7 Sum[ Cos[2Pi*k/7]^(n + 1), {k, 0, 6}]]]; Table[ f[n], {n, 0, 34}] (* Robert G. Wilson v, Jun 01 2004 *)

CROSSREFS

Equals A095307(n+1) - A095308(n-1).

Sequence in context: A028850 A138364 A095364 * A161678 A232267 A293939

Adjacent sequences:  A094049 A094050 A094051 * A094053 A094054 A094055

KEYWORD

easy,nonn

AUTHOR

Herbert Kociemba, May 31 2004

EXTENSIONS

More terms from Robert G. Wilson v, Jun 01 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 19:16 EDT 2021. Contains 348155 sequences. (Running on oeis4.)