cp's OEIS Frontend

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.

A136451 Triangle T(n,k) with the coefficient [x^k] of the characteristic polynomial of the following n X n matrix: 2 on the main antidiagonal, -1 on the adjacent sub-antidiagonals and 0 otherwise.

This page as a plain text file.
%I A136451 #10 Sep 21 2015 03:52:41
%S A136451 1,2,-1,-3,2,1,-4,6,2,-1,5,-10,-9,2,1,6,-19,-16,12,2,-1,-7,28,42,-22,
%T A136451 -15,2,1,-8,44,68,-74,-28,18,2,-1,9,-60,-138,126,115,-34,-21,2,1,10,
%U A136451 -85,-208,316,202,-165,-40,24,2,-1,-11,110,363,-506,-605,296,224,-46,-27,2,1
%N A136451 Triangle T(n,k) with the coefficient [x^k] of the characteristic polynomial of the following n X n matrix: 2 on the main antidiagonal, -1 on the adjacent sub-antidiagonals and 0 otherwise.
%C A136451 We start from tri-antidiagonal variants of the Cartan A-n group matrix. For n=1 this is {2}, for n=2 this is {{-1,2},{2,-1}}, for n=3 {{0,-1,2},{-1,2,-1},{2,-1,0}}, for n =4 {{0,0,-1,2},{0,-1,2,-1},{-1,2,-1,0},{2,-1,0,0}} etc. The n-th row of the triangle are the expansion coefficients of the characteristic polynomial.
%C A136451 For n=0, the empty product of the empty matrix is assigned the value T(0,0)=1.
%C A136451 Row sums (characteristic polynomials evaluated at x=0) are 1, 1, 0, 3, -11, -16, 29, 21, 0, 55, -199, -288, 521, 377, 0, 987, -3571, -5168, 9349, 6765, 0, ... (see A038150).
%e A136451 1;
%e A136451 2, -1;
%e A136451 -3,2, 1;
%e A136451 -4, 6, 2, -1;
%e A136451 5, -10, -9, 2, 1;
%e A136451 6, -19, -16, 12, 2, -1;
%e A136451 -7,28, 42, -22, -15, 2, 1;
%e A136451 -8, 44, 68, -74, -28,18, 2, -1;
%e A136451 9, -60, -138, 126, 115, -34, -21, 2, 1;
%e A136451 10, -85, -208,316, 202, -165, -40, 24, 2, -1;
%e A136451 -11, 110, 363, -506, -605, 296, 224, -46, -27, 2, 1;
%p A136451 A136451x := proc(n,x)
%p A136451     local A,r,c ;
%p A136451     A := Matrix(1..n,1..n) ;
%p A136451     for r from 1 to n do
%p A136451     for c from 1 to n do
%p A136451             A[r,c] :=0 ;
%p A136451         if r+c = 1+n then
%p A136451             A[r,c] := A[r,c]+2 ;
%p A136451         elif abs(r+c-1-n)= 1 then
%p A136451             A[r,c] :=  A[r,c]-1 ;
%p A136451         end if;
%p A136451     end do:
%p A136451     end do:
%p A136451     (-1)^n*LinearAlgebra[CharacteristicPolynomial](A,x) ;
%p A136451 end proc;
%p A136451 A136451 := proc(n,k)
%p A136451     coeftayl( A136451x(n,x),x=0,k) ;
%p A136451 end proc:
%p A136451 seq(seq(A136451(n,k),k=0..n),n=0..12) ; # _R. J. Mathar_, Dec 04 2011
%t A136451 H[n_] := Table[Table[If[i + j - 1 == n, 2,If[i + j - 1 == n + 1, -1, If[i + j - 1 == n - 1, -1, 0]]], {i, 1, n}], {j, 1, n}]; a = Join[{{1}}, Table[CoefficientList[CharacteristicPolynomial[H[n], x], x], {n, 1, 10}]]; Flatten[a']
%Y A136451 Cf. A124018 (variant), A005993 (column k=1), A061927 (bisection column k=2).
%K A136451 tabl,sign
%O A136451 0,2
%A A136451 _Roger L. Bagula_, Mar 19 2008