

A117965


Triangle read by rows: T(i,j) = F(i)*F(j)*C(i,j) for 1 <= j <= i, where F(n) is the nth Fibonacci number and C(n,m) is a binomial coefficient.


2



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;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..50.


EXAMPLE

1; 2,1; 6,6,4; 12,18,24,9; ...


PROG

(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 repetition).
Sequence in context: A052121 A193895 A193561 * A111646 A117753 A145883
Adjacent sequences: A117962 A117963 A117964 * A117966 A117967 A117968


KEYWORD

nonn,tabl


AUTHOR

Roger L. Bagula, Apr 05 2006


STATUS

approved



