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 A122070 #18 Sep 08 2022 08:45:28
%S A122070 1,1,2,2,6,5,3,15,24,13,5,32,78,84,34,8,65,210,340,275,89,13,126,510,
%T A122070 1100,1335,864,233,21,238,1155,3115,5040,4893,2639,610,34,440,2492,
%U A122070 8064,16310,21112,17080,7896,1597,55,801,5184,19572,47502,76860,82908,57492,23256,4181
%N A122070 Triangle given by T(n,k) = Fibonacci(n+k+1)*binomial(n,k) for 0<=k<=n.
%C A122070 Subtriangle of (0, 1, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 1, 1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
%C A122070 Mirror image of the triangle in A185384.
%H A122070 G. C. Greubel, <a href="/A122070/b122070.txt">Rows n = 0..100 of triangle, flattened</a>
%F A122070 T(n,k) = A000045(n+k+1)*A007318(n,k) .
%F A122070 T(n,n) = Fibonacci(2*n+1) = A001519(n+1) .
%F A122070 Sum_{k=0..n} T(n,k) = Fibonacci(3*n+1) = A033887(n) .
%F A122070 Sum_{k=0..n}(-1)^k*T(n,k) = (-1)^n = A033999(n) .
%F A122070 Sum_{k=0..floor(n/2)} T(n-k,k) = (Fibonacci(n+1))^2 = A007598(n+1).
%F A122070 Sum_{k=0..n} T(n,k)*2^k = Fibonacci(4*n+1) = A033889(n).
%F A122070 Sum_{k=0..n} T(n,k)^2 = A208588(n).
%F A122070 G.f.: (1-y*x)/(1-(1+3y)*x-(1+y-y^2)*x^2).
%F A122070 T(n,k) = T(n-1,k) + 3*T(n-1,k-1) + T(n-2,k) + T(n-2,k-1) - T(n-2,k-2), T(0,0) = T(1,0) = 1, T(1,1) = 2, T(n,k) = 0 if k<0 or if k>n.
%F A122070 T(n,k) = A185384(n,n-k).
%F A122070 T(2n,n) = binomial(2n,n)*Fibonacci(3*n+1) = A208473(n).
%e A122070 Triangle begins:
%e A122070 1;
%e A122070 1, 2;
%e A122070 2, 6, 5;
%e A122070 3, 15, 24, 13;
%e A122070 5, 32, 78, 84, 34;
%e A122070 8, 65, 210, 340, 275, 89;
%e A122070 13, 126, 510, 1100, 1335, 864, 233;
%e A122070 (0, 1, 1, -1, 0, 0, ...) DELTA (1, 1, 1, 0, 0, ...) begins :
%e A122070 1;
%e A122070 0, 1;
%e A122070 0, 1, 2;
%e A122070 0, 2, 6, 5;
%e A122070 0, 3, 15, 24, 13;
%e A122070 0, 5, 32, 78, 84, 34;
%e A122070 0, 8, 65, 210, 340, 275, 89;
%e A122070 0, 13, 126, 510, 1100, 1335, 864, 233;
%p A122070 with(combinat): seq(seq(binomial(n,k)*fibonacci(n+k+1), k=0..n), n=0..10); # _G. C. Greubel_, Oct 02 2019
%t A122070 Table[Fibonacci[n+k+1]*Binomial[n,k], {n,0,10}, {k,0,n}]//Flatten (* _G. C. Greubel_, Oct 02 2019 *)
%o A122070 (PARI) T(n,k) = binomial(n,k)*fibonacci(n+k+1);
%o A122070 for(n=0,10, for(k=0,n, print1(T(n,k), ", "))) \\ _G. C. Greubel_, Oct 02 2019
%o A122070 (Magma) [Binomial(n,k)*Fibonacci(n+k+1): k in [0..n], n in [0..10]]; // _G. C. Greubel_, Oct 02 2019
%o A122070 (Sage) [[binomial(n,k)*fibonacci(n+k+1) for k in (0..n)] for n in (0..10)] # _G. C. Greubel_, Oct 02 2019
%o A122070 (GAP) Flat(List([0..10], n-> List([0..n], k-> Binomial(n,k)*Fibonacci(n+ k+1) ))); # _G. C. Greubel_, Oct 02 2019
%Y A122070 Cf. A000045, A001519, A033887, A033889, A185384.
%K A122070 nonn,tabl
%O A122070 0,3
%A A122070 _Philippe Deléham_, Oct 15 2006, Mar 13 2012
%E A122070 Corrected and extended by _Philippe Deléham_, Mar 13 2012
%E A122070 Term a(50) corrected by _G. C. Greubel_, Oct 02 2019