|
Search: id:A093040
|
|
|
| A093040 |
|
Expansion of (1+x)/((1+x+x^2)(1-x-x^2)). |
|
+0
3
|
|
| 1, 1, 1, 3, 4, 6, 11, 17, 27, 45, 72, 116, 189, 305, 493, 799, 1292, 2090, 3383, 5473, 8855, 14329, 23184, 37512, 60697, 98209, 158905, 257115, 416020, 673134, 1089155, 1762289, 2851443, 4613733, 7465176, 12078908, 19544085, 31622993, 51167077
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
The sequence 0,1,1,1,3... has a(n)=Fib(n+1)/2-A049347(n)/2. It counts paths of length n between two of the vertices of the graph with adjacency matrix [0,1,0,0;0,0,1,1;1,1,0,0;0,0,1,0].
Diagonal sums of Riordan array ((1+x), x(1+x)^2). - Paul Barry (pbarry(AT)wit.ie), May 31 2006
|
|
REFERENCES
|
MacKay, Information Theory, Inference and Learning Algorithms, CUP, 2003, p. 251
|
|
LINKS
|
A. Stoimenow, Generating Functions, Fibonacci Numbers and Rational Knots
|
|
FORMULA
|
G.f.: ((1+x)/(1-x-x^2)+(1-x^2)/(1-x^3))/2; a(n)=a(n-2)+2a(n-3)+a(n-5); a(n)=Fib(n+2)/2+sqrt(3)sin(2*pi*n/3+pi/3)/3=Fib(n+2)/2+A057078(n)/2.
a(n-1)=sum{k=0..floor(n/2), if(mod(n-k, 2)=1, binomial(n-k, k), 0)}; a(n-1)=A094686(n)-Fib(n); - Paul Barry (pbarry(AT)wit.ie), Jan 13 2005
a(n)=sum{k=0..floor(n/2), C(2k+1,n-2k)}; - Paul Barry (pbarry(AT)wit.ie), May 31 2006
|
|
CROSSREFS
|
Cf. A005252.
Sequence in context: A154331 A001130 A069825 this_sequence A022935 A048229 A002090
Adjacent sequences: A093037 A093038 A093039 this_sequence A093041 A093042 A093043
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Mar 15 2004
|
|
|
Search completed in 0.002 seconds
|
