|
Search: id:A094439
|
|
|
| A094439 |
|
Triangular array T(n,k)=F(k+4)C(n,k), k=0,1,2,3,...,n; n>=0. |
|
+0
2
|
|
| 3, 3, 5, 3, 10, 8, 3, 15, 24, 13, 3, 20, 48, 52, 21, 3, 25, 80, 130, 105, 34, 3, 30, 120, 260, 315, 204, 55, 3, 35, 168, 455, 735, 714, 385, 89, 3, 40, 224, 728, 1470, 1904, 1540, 712, 144, 3, 45, 288, 1092, 2646, 4284, 4620, 3204, 1296, 233, 3, 50, 360, 1560, 4410, 8568
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n+4) and n-th alternating row sum is -F(n-4).
|
|
EXAMPLE
|
First four rows:
3
3 5
3 10 8
3 15 24 13 sum = 3+15+24+13=55=F(10); alt.sum = 3-15+24-13=-1=-F(-1).
T(3,2)=F(5)C(3,2)=5*3=15.
|
|
CROSSREFS
|
Cf. A094444, A000045.
Sequence in context: A029620 A048691 A071053 this_sequence A122037 A008316 A072820
Adjacent sequences: A094436 A094437 A094438 this_sequence A094440 A094441 A094442
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), May 03 2004
|
|
|
Search completed in 0.002 seconds
|
