|
%I #21 Nov 26 2016 11:36:53
%S 1,1,2,2,3,4,3,5,6,7,5,8,10,11,12,8,13,16,18,19,20,13,21,26,29,31,32,
%T 33,21,34,42,47,50,52,53,54,34,55,68,76,81,84,86,87,88,55,89,110,123,
%U 131,136,139,141,142,143,89,144,178,199,212,220,225,228,230,231
%N Triangle read by rows, A000012 * A127647 * A000012.
%C Row sums = A014286 (1, 3, 9, 21, 46, 94, ...); left border = Fibonacci numbers.
%H Robert Israel, <a href="/A143061/b143061.txt">Table of n, a(n) for n = 1..10011</a> (rows 1 to 141, flattened)
%F From _Robert Israel_, Nov 06 2016: (Start)
%F T(n,k) = A000045(n+2) - A000045(n+2-k) for 1 <= k <= n.
%F G.f. as triangle: x*y*(1+x^2*y)/((1-x*y)*(1-x-x^2)*(1-x*y-x^2*y^2)). (End)
%e First few rows of the triangle are:
%e 1;
%e 1, 2;
%e 2, 3, 4;
%e 3, 5, 6, 7;
%e 5, 8, 10, 11, 12;
%e 8, 13, 16, 18, 19, 20;
%e ...
%p seq(seq(combinat:-fibonacci(i+2)-combinat:-fibonacci(i+2-j),j=1..i),i=1..20); # _Robert Israel_, Nov 06 2016
%Y Cf. A000012, A000045, A014286, A127647.
%K nonn,tabl
%O 1,3
%A _Gary W. Adamson_, Jul 20 2008
%E Corrected by _Dintle N Kagiso_, Nov 06 2016
|
