|
Search: id:A117965
|
|
|
| A117965 |
|
Triangle read by rows: T(i,j) = F(i)*F(j)*C(i,j) for 1 <= j <= i, where F(n) is the n-th Fibonacci number and C(n,m) is a binomial coefficient. |
|
+0
3
|
|
| 1, 2, 1, 6, 6, 4, 12, 18, 24, 9, 25, 50, 100, 75, 25, 48, 120, 320, 360, 240, 64, 91, 273, 910, 1365, 1365, 728, 169, 168, 588, 2352, 4410, 5880, 4704, 2184, 441, 306, 1224, 5712, 12852, 21420, 22848, 15912, 6426, 1156, 550, 2475, 13200, 34650, 69300
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
1; 2,1; 6,6,4; 12,18,24,9; ...
|
|
PROGRAM
|
(PARI) for(i=1, 10, for(j=1, i, print1(fibonacci(i)*fibonacci(j)*binomial(i, j), ", ")))
|
|
CROSSREFS
|
Cf. A000045 (Fibonacci numbers), A007318 (Pascal's triangle), A074909 (running sum of Pascal's triangle), A115947 (sorted, with repetion).
Sequence in context: A079641 A075181 A052121 this_sequence A111646 A117753 A062820
Adjacent sequences: A117962 A117963 A117964 this_sequence A117966 A117967 A117968
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 05 2006
|
|
|
Search completed in 0.002 seconds
|
