login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #6 Mar 12 2014 16:36:52

%S 1,2,1,6,6,4,12,18,24,9,25,50,100,75,25,48,120,320,360,240,64,91,273,

%T 910,1365,1365,728,169,168,588,2352,4410,5880,4704,2184,441,306,1224,

%U 5712,12852,21420,22848,15912,6426,1156,550,2475,13200,34650,69300

%N 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 1; 2,1; 6,6,4; 12,18,24,9; ...

%o (PARI) for(i=1,10,for(j=1,i,print1(fibonacci(i)*fibonacci(j)*binomial(i,j),",")))

%Y Cf. A000045 (Fibonacci numbers), A007318 (Pascal's triangle), A074909 (running sum of Pascal's triangle), A115947 (sorted, with repetition).

%K nonn,tabl

%O 1,2

%A _Roger L. Bagula_, Apr 05 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)