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.

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

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: A193895 A193561 A328349 * A111646 A363629 A342965

Adjacent sequences: A117962 A117963 A117964 * A117966 A117967 A117968

Keyword

nonn,tabl

Author

Roger L. Bagula, Apr 05 2006

Status

approved