|
%I #7 Sep 01 2018 21:28:12
%S 1,2,2,3,3,4,4,4,5,6,5,5,6,7,9,6,6,7,8,10,13,7,7,8,9,11,14,19,8,8,9,
%T 10,12,15,20,28,9,9,10,11,13,16,21,29,42,10,10,11,12,14,17,22,30,43,
%U 64,11,11,12,13,15,18,23,31,44,65,99,12,12,13,14,16,19,24,32,45,66,100,155
%N Triangle read by rows: T(n,k) = n + Fibonacci(k) - 1, 1 <= k <= n.
%C Right border = A081659, row sums = A132922: (1, 4, 10, 19, 32, ...).
%H Andrew Howroyd, <a href="/A132921/b132921.txt">Table of n, a(n) for n = 1..1275</a> (first 50 rows)
%F Equals (A127648 * A000012 + A000012 * A127647) - A000012 as infinite lower triangular matrices.
%e First few rows of the triangle are:
%e 1;
%e 2, 2;
%e 3, 3, 4;
%e 4, 4, 5, 6;
%e 5, 5, 6, 7, 9;
%e ...
%e Column 3 = 4, 5, 6, 7, ...; since A081659(2) = 4.
%o (PARI) T(n,k)=if(k<=n, n + fibonacci(k) - 1, 0) \\ _Andrew Howroyd_, Sep 01 2018
%Y Row sums are A132922.
%Y Cf. A127648, A127647, A081659.
%K nonn,tabl
%O 1,2
%A _Gary W. Adamson_, Sep 05 2007
%E Name clarified and terms a(56) and beyond from _Andrew Howroyd_, Sep 01 2018
|
