# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a117965
Showing 1-1 of 1

%I A117965 #6 Mar 12 2014 16:36:52
%S A117965 1,2,1,6,6,4,12,18,24,9,25,50,100,75,25,48,120,320,360,240,64,91,273,
%T A117965 910,1365,1365,728,169,168,588,2352,4410,5880,4704,2184,441,306,1224,
%U A117965 5712,12852,21420,22848,15912,6426,1156,550,2475,13200,34650,69300
%N 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.
%e A117965 1; 2,1; 6,6,4; 12,18,24,9; ...
%o A117965 (PARI) for(i=1,10,for(j=1,i,print1(fibonacci(i)*fibonacci(j)*binomial(i,j),",")))
%Y A117965 Cf. A000045 (Fibonacci numbers), A007318 (Pascal's triangle), A074909 (running sum of Pascal's triangle), A115947 (sorted, with repetition).
%K A117965 nonn,tabl
%O A117965 1,2
%A A117965 _Roger L. Bagula_, Apr 05 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE