This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099177 a(n)=2a(n-1)+4a(n-2)-4a(n-3)-4a(n-4). 4
 0, 1, 2, 8, 20, 60, 160, 448, 1216, 3344, 9120, 24960, 68160, 186304, 508928, 1390592, 3799040, 10379520, 28357120, 77473792, 211661824, 578272256, 1579868160, 4316282880, 11792302080, 32217174016, 88018952192, 240472260608 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Form the 6 node graph with matrix A=[1,1,1,1,0,0; 1,1,0,0,1,1; 1,0,0,0,0,0; 1,0,0,0,0,0; 0,1,0,0,0,0; 0,1,0,0,0,0]. Then A099177 counts walks of length n between the degree 5 vertices. LINKS Index entries for linear recurrences with constant coefficients, signature (2,4,-4,-4). FORMULA G.f.: x/((1-2x^2)(1-2x-2x^2)); a(n)=(3+sqrt(3))(1+sqrt(3))^n/12+(3-sqrt(3))(1-sqrt(3))^n/12-2^((n-4)/2)(1+(-1)^n); a(n)=A002605(n)/2-2^((n-4)/2)(1+(-1)^n). a(n)=sum{k=0..floor((n+1)/2), binomial(n-k+1, k-1)2^(n-k)} - Paul Barry, Oct 23 2004 CROSSREFS Cf. A099176. Sequence in context: A174477 A024997 A081157 * A100097 A133467 A091004 Adjacent sequences:  A099174 A099175 A099176 * A099178 A099179 A099180 KEYWORD easy,nonn AUTHOR Paul Barry, Oct 02 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.

Last modified December 11 01:07 EST 2019. Contains 329910 sequences. (Running on oeis4.)