|
%I #16 Sep 08 2022 08:45:24
%S 1,1,2,1,1,3,1,1,2,5,1,1,2,3,8,1,1,2,3,5,13,1,1,2,3,5,8,21,1,1,2,3,5,
%T 8,13,34,1,1,2,3,5,8,13,21,55,1,1,2,3,5,8,13,21,34,89,1,1,2,3,5,8,13,
%U 21,34,55,144,1,1,2,3,5,8,13,21,34,55,89,233
%N Triangle, row sums = A001595.
%C Row sums = A001595 = (1, 3, 9, 15, 25, 41, ...).
%H G. C. Greubel, <a href="/A117502/b117502.txt">Rows n = 1..100 of triangle, flattened</a>
%F n-th row = first n Fibonacci terms, with a deletion of F(n).
%F Columns of the triangle are difference terms of the array in A117501.
%F T(n,k) = Fibonacci(k) for k < n and T(n,n) = Fibonacci(n+1). - _G. C. Greubel_, Jul 10 2019
%e Row 5 of the triangle = (1, 1, 2, 3, 8); the first 5 Fibonacci terms with a deletion of F(5) = 5.
%e First few rows of the triangle are:
%e 1;
%e 1, 2;
%e 1, 1, 3;
%e 1, 1, 2, 5;
%e 1, 1, 2, 3, 8; ...
%t Table[If[k==n, Fibonacci[n+1], Fibonacci[k]], {n, 20}, {k, n}]//Flatten (* _G. C. Greubel_, Jul 10 2019 *)
%o (PARI) T(n,k) = if(k==n, fibonacci(n+1), fibonacci(k)); \\ _G. C. Greubel_, Jul 10 2019
%o (Magma) [k eq n select Fibonacci(n+1) else Fibonacci(k): k in [1..n], n in [1..20]]; // _G. C. Greubel_, Jul 10 2019
%o (Sage)
%o def T(n, k):
%o if (k==n): return fibonacci(n+1)
%o else: return fibonacci(k)
%o [[T(n, k) for k in (1..n)] for n in (1..20)] # _G. C. Greubel_, Jul 10 2019
%o (GAP)
%o T:= function(n,k)
%o if k=n then return Fibonacci(n+1);
%o else return Fibonacci(k);
%o fi;
%o end;
%o Flat(List([1..20], n-> List([1..n], k-> T(n,k) ))); # _G. C. Greubel_, Jul 14 2019
%Y Cf. A000045, A117501, A001595.
%K nonn,tabl
%O 1,3
%A _Gary W. Adamson_, Mar 23 2006
%E More terms added by _G. C. Greubel_, Jul 10 2019
|
