The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204021 Triangle read by rows: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of min(2i-1,2j-1) (A157454). 5
1, 1, -1, 2, -4, 1, 4, -12, 9, -1, 8, -32, 40, -16, 1, 16, -80, 140, -100, 25, -1, 32, -192, 432, -448, 210, -36, 1, 64, -448, 1232, -1680, 1176, -392, 49, -1, 128, -1024, 3328, -5632, 5280, -2688, 672, -64, 1, 256, -2304, 8640, -17472, 20592 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Let p(n)=p(n,x) be the characteristic polynomial of the n-th principal submatrix. The zeros of p(n) are real, and they interlace the zeros of p(n+1). See A202605 and A204016 for guides to related sequences.
a(0)=1 by convention. - Philippe Deléham, Nov 17 2013
The n roots of the n-th polynomial are 1/(1+cos((2*k-1)*Pi/(2*n))) for k = 1..n. See my pdf in the link section for the proof. - Jianing Song, Dec 01 2023
REFERENCES
(For references regarding interlacing roots, see A202605.)
LINKS
Eric Weisstein's World of Mathematics, Morgan-Voyce polynomials
FORMULA
From Peter Bala, May 01 2012: (Start)
Triangle appears to be a signed version of the row reverse of A211957.
If true, then for 0 <= k <= n-1, T(n,k) = (-1)^k*n/(n-k)*2^(n-k-1)*binomial(2*n-k-1,k) and sum {k = 0..n} T(n,k)*x^(n-k) = 1/2*(-1)^n*(b(2*n,-2*x) + 1)/b(n,-2*x), where b(n,x) := sum {k = 0..n} binomial(n+k,2*k)*x^k are the Morgan-Voyce polynomials of A085478.
Conjectural o.g.f.: t*(1-x-x^2*t)/(1-2*t*(1-x)+t^2*x^2) = (1-x)*t + (2-4*x+x^2)*t^2 + ....
(End)
T(n,k)=2*T(n-1,k)-2*T(n-1,k-1)-T(n-2,k-2), T(0,0)=T(1,0)=1, T(1,1)=-1, T(n,k)=0 of k<0 or if k>n. - Philippe Deléham, Nov 17 2013
EXAMPLE
Top of the triangle:
1
1....-1
2....-4.....1
4....-12....9....-1
8....-32....40...-16....1
16...-80....140..-100...25....-1
32...-192...432..-448...210...-36....1
-448=2*(-100)-2*140-(-32). - Philippe Deléham, Nov 17 2013
MATHEMATICA
f[i_, j_] := Min[2 i - 1, 2 j - 1];
m[n_] := Table[f[i, j], {i, 1, n}, {j, 1, n}]
TableForm[m[6]] (* 6x6 principal submatrix *)
Flatten[Table[f[i, n + 1 - i],
{n, 1, 15}, {i, 1, n}]] (* A157454 *)
p[n_] := CharacteristicPolynomial[m[n], x];
c[n_] := CoefficientList[p[n], x]
TableForm[Flatten[Table[p[n], {n, 1, 10}]]]
Table[c[n], {n, 1, 12}]
Flatten[%] (* A204021 *)
TableForm[Table[c[n], {n, 1, 10}]]
CROSSREFS
Sequence in context: A361873 A085111 A181332 * A236471 A220328 A220935
KEYWORD
tabl,sign
AUTHOR
Clark Kimberling, Jan 11 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 01:18 EDT 2024. Contains 372980 sequences. (Running on oeis4.)