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 A123148 #13 Jul 18 2023 04:12:00
%S A123148 -1,-2,1,-2,2,-1,-4,4,-2,1,-4,8,-6,2,-1,-8,12,-12,8,-2,1,-8,24,-24,16,
%T A123148 -10,2,-1,-16,32,-48,40,-20,12,-2,1,-16,64,-80,80,-60,24,-14,2,-1,-32,
%U A123148 80,-160,160,-120,84,-28,16,-2,1,-32,160,-240,320,-280,168,-112,32,-18,2,-1
%N A123148 Triangle read by rows: T(n,k) is the coefficient of x^k in the polynomial p(n,x) defined by p(0,x) = -1, p(1,x) = x-2, p(n,x) = -x*p(n-1,x) + 2*p(n-2,x) for n >= 3 and 0 <= k <= n.
%H A123148 G. C. Greubel, <a href="/A123148/b123148.txt">Rows n = 0..50 of the triangle, flattened</a>
%F A123148 T(n, k) = [x^k]( p(n,x) ), where p(0,x) = -1, p(1,x) = x-2, p(n,x) = -x*p(n-1,x) + 2*p(n-2,x).
%F A123148 Sum_{k=0..n} T(n, k) = -1.
%F A123148 Sum_{k=0..n} (-1)^k * T(n,k) = -A001045(n+2).
%F A123148 From _G. C. Greubel_, Jul 17 2023: (Start)
%F A123148 T(n,k) = (-1)^(k+1)*2^Floor((n-k+1)/2)*Binomial( Floor((n+k)/2), k).
%F A123148 T(n,k) = (-1)^(k+1)*2^Floor((n-k+1)/2)*A046854(n,k).
%F A123148 T(n,0) = -A016116(n+1).
%F A123148 T(n,1) = A171647(n).
%F A123148 Sum_{k=0..n} (-1)^k * abs(T(n,k)) = 1.
%F A123148 Sum_{k=0..floor(n/2)} T(n-k,k) = - A000034(n).
%F A123148 Sum_{k=0..floor(n/2)} (-1)^k*T(n-k,k) = -A038754(n). (End)
%e A123148 The first few polynomials, p(n,x), are:
%e A123148 p(0,x) = -1;
%e A123148 p(1,x) = -2 + x;
%e A123148 p(2,x) = -2 + 2*x - x^2;
%e A123148 p(3,x) = -4 + 4*x - 2*x^2 + x^3;
%e A123148 p(4,x) = -4 + 8*x - 6*x^2 + 2*x^3 - x^4;
%e A123148 The triangle, T(n, k) = [x^k] p(n, x), begins as:
%e A123148 -1;
%e A123148 -2, 1;
%e A123148 -2, 2, -1;
%e A123148 -4, 4, -2, 1;
%e A123148 -4, 8, -6, 2, -1;
%e A123148 -8, 12, -12, 8, -2, 1;
%e A123148 -8, 24, -24, 16, -10, 2, -1;
%p A123148 p[0]:=-1: p[1]:=x-2: for n from 2 to 10 do p[n]:=sort(expand(-x*p[n-1]+2*p[n-2])) od: for n from 0 to 10 do seq(coeff(p[n],x,k),k=0..n) od; # yields sequence in triangular form
%t A123148 p[0,x]= -1; p[1,x]= x-2; p[k_, x_]:= p[k,x]= -x*p[k-1,x] + 2*p[k-2,x];
%t A123148 T[n_, k_]:= Coefficient[p[n, x], x, k];
%t A123148 Table[T[n,k], {n,0,12},{k,0,n}]//Flatten
%o A123148 (Magma)
%o A123148 A123148:=func< n,k | (-1)^(k+1)*2^Floor((n-k+1)/2)*Binomial( Floor((n+k)/2), k) >;
%o A123148 [A123148(n,k): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Jul 17 2023
%o A123148 (SageMath)
%o A123148 def A123148(n,k): return (-1)^(k+1)*2^((n-k+1)//2)*binomial((n+k)//2, k)
%o A123148 flatten([[A123148(n,k) for k in range(n+1)] for n in range(13)]) # _G. C. Greubel_, Jul 17 2023
%Y A123148 Cf. A000034, A001045, A016116, A038754, A046854, A171647.
%K A123148 sign,tabl
%O A123148 0,2
%A A123148 _Roger L. Bagula_, Oct 01 2006
%E A123148 Edited by _N. J. A. Sloane_, Oct 29 2006