|
Search: id:A094438
|
|
|
| A094438 |
|
Triangular array T(n,k)=F(k+3)C(n,k), k=0,1,2,3,...,n; n>=0. |
|
+0
3
|
|
| 2, 2, 3, 2, 6, 5, 2, 9, 15, 8, 2, 12, 30, 32, 13, 2, 15, 50, 80, 65, 21, 2, 18, 75, 160, 195, 126, 34, 2, 21, 105, 280, 455, 441, 238, 55, 2, 24, 140, 448, 910, 1176, 952, 440, 89, 2, 27, 180, 672, 1638, 2646, 2856, 1980, 801, 144, 2, 30, 225, 960, 2730, 5292, 7140
(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+3) and n-th alternating row sum is F(n-3).
|
|
EXAMPLE
|
First four rows:
2
2 3
2 6 5
2 9 15 8 sum = 2+9+15+8=34=F(9); alt.sum = 2-9+15-8=0=-F(0).
T(3,2)=F(5)C(3,2)=5*3=15.
|
|
CROSSREFS
|
Cf. A094443, A000045.
Sequence in context: A078224 A128710 A095757 this_sequence A015996 A092976 A084705
Adjacent sequences: A094435 A094436 A094437 this_sequence A094439 A094440 A094441
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), May 03 2004
|
|
|
Search completed in 0.002 seconds
|
