This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A171731 #12 Jan 07 2015 05:13:26
%S A171731 0,1,0,1,2,0,2,3,3,0,3,8,6,4,0,5,15,20,10,5,0,8,30,45,40,15,6,0,13,56,
%T A171731 105,105,70,21,7,0,21,104,224,280,210,112,28,8,0,34,189,468,672,630,
%U A171731 378,168,36,9,0,55,340,945,1560,1680,1260,630,240,45,10,0
%N A171731 Triangle T : T(n,k)= binomial(n,k)*Fibonacci(n-k)= A007318(n,k)*A000045(n-k).
%C A171731 Diagonal sums : A112576.
%C A171731 Essentially the same as A094440. - _Peter Bala_, Jan 06 2015
%F A171731 Sum_{k, 0<=k<=n} T(n,k)*x^k = A000045(n), A001906(n), A093131(n), A099453(n-1), A081574(n), A081575(n) for x = 0,1,2,3,4,5 respectively. Sum_{k, 0<=k<=n} T(n,k)*2^(n-k) = A014445(n).
%e A171731 Triangle begins :
%e A171731 0 ;
%e A171731 1,0 ;
%e A171731 1,2,0 ;
%e A171731 2,3,3,0 ;
%e A171731 3,8,6,4,0 ;
%e A171731 5,15,20,10,5,0 ;
%e A171731 ...
%t A171731 Flatten[Table[Binomial[n,k]Fibonacci[n-k],{n,0,10},{k,0,n}]] (* _Harvey P. Dale_, Jan 16 2013 *)
%Y A171731 Cf. A000045, A007318, A094440.
%K A171731 nonn,tabl
%O A171731 0,5
%A A171731 _Philippe Deléham_, Dec 16 2009