|
Search: id:A054452
|
|
| |
|
| 0, 1, 5, 17, 50, 138, 370, 979, 2575, 6755, 17700, 46356, 121380, 317797, 832025, 2178293, 5702870, 14930334, 39088150, 102334135, 267914275, 701408711, 1836311880, 4807526952, 12586269000, 32951280073, 86267571245
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n) = sum(A027941(k-1), k=0..n)= F(2*(n+1))-(n+1) = A054450(2*n+3, 2)= A054451(2*n+1).
G.f.: x*Fibe(x)/(1-x)^2, with Fibe(x) := 1/(1-3*x+x^2) = g.f. A001906(n+1) (Fibonacci numbers F(2(n+1))).
Fourth diagonal of array defined by T(i, 1)=T(1, j)=1, T(i, j)=Max(T(i-1, j)+T(i-1, j-1); T(i-1, j-1)+T(i, j-1)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 05 2003
|
|
MAPLE
|
a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=3*a[n-1]-a[n-2] od: seq(a[n]-n, n=1..27); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 20 2008
with (combinat):seq(fibonacci(2*n)-n, n=1..27); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 19 2008
|
|
CROSSREFS
|
Cf. A027941, A054451, A001906, A052952.
Sequence in context: A082753 A000337 A086866 this_sequence A039783 A116521 A137500
Adjacent sequences: A054449 A054450 A054451 this_sequence A054453 A054454 A054455
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Apr 27 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 28 2000
|
|
|
Search completed in 0.002 seconds
|
