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.

Showing 1-4 of 4 results.

A202678 Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the symmetric matrix A185957; by antidiagonals.

Original entry on oeis.org

1, -1, 1, -11, 1, 1, -30, 57, -1, 1, -50, 395, -203, 1, 1, -70, 1133, -3221, 574, -1, 1, -90, 2271, -15840, 19011, -1386, 1, 1, -110, 3809, -45980, 156892, -88729, 2982, -1, 1, -130, 5747, -101640, 660617, -1195097, 346295, -5874
Offset: 1

Views

Author

Clark Kimberling, Dec 22 2011

Keywords

Comments

Let p(n)=p(n,x) be the characteristic polynomial of the n-th principal submatrix. The zeros of p(n) are positive, and they are interlace the zeros of p(n+1).

Examples

			The 1st principal submatrix (ps) of A185957 is {{1}} (using Mathematica matrix notation), with p(1)=1-x and zero-set {1}.
...
The 2nd ps is {{1,3},{3,10}}, with p(2)=1-11x+x^2 and zero-set {0.091..., 10.908...}.
...
The 3rd ps is {{1,3,6},{3,10,21},{6,21,46}}, with p(3)=1-30x+57x^2-x^3 and zero-set {0.035..., 0.495..., 56.469...}.
...
Top of the array:
1...-1
1...-11...1
1...-30...57....-1
1...-50...395...-203...1
		

Crossrefs

Programs

  • Mathematica
    f[k_] := k (k + 1)/2
    U[n_] :=  NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[Table[f[k], {k, 1, n}]];
    L[n_] := Transpose[U[n]];
    F[n_] := CharacteristicPolynomial[L[n].U[n], x];
    c[n_] := CoefficientList[F[n], x]
    TableForm[Flatten[Table[F[n], {n, 1, 10}]]]
    Table[c[n], {n, 1, 12}]
    Flatten[%]
    TableForm[Table[c[n], {n, 1, 10}]]

A202605 Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the Fibonacci self-fusion matrix (A202453).

Original entry on oeis.org

1, -1, 1, -3, 1, 1, -6, 9, -1, 1, -9, 26, -24, 1, 1, -12, 52, -96, 64, -1, 1, -15, 87, -243, 326, -168, 1, 1, -18, 131, -492, 1003, -1050, 441, -1, 1, -21, 184, -870, 2392, -3816, 3265, -1155, 1, 1, -24, 246, -1404, 4871, -10500, 13710
Offset: 1

Views

Author

Clark Kimberling, Dec 21 2011

Keywords

Comments

Let p(n)=p(n,x) be the characteristic polynomial of the n-th principal submatrix. The zeros of p(n) are positive and interlace the zeros of p(n+1). (See the references and examples.)
Following is a guide to sequences (f(n)) for symmetric matrices (self-fusion matrices) and characteristic polynomials. Notation: F(k)=A000045(k) (Fibonacci numbers); floor(n*tau)=A000201(n) (lower Wythoff sequence); "periodic x,y" represents the sequence (x,y,x,y,x,y,...).
f(n)........ symmetric matrix.. char. polynomial
1............... A087062....... A202672
n............... A115262....... A202673
n^2............. A202670....... A202671
2n-1............ A202674....... A202675
3n-2............ A202676....... A202677
n(n+1)/2........ A185957....... A202678
2^n-1........... A202873....... A202767
2^(n-1)......... A115216....... A202868
floor(n*tau).... A202869....... A202870
F(n)............ A202453....... A202605
F(n+1).......... A202874....... A202875
Lucas(n)........ A202871....... A202872
F(n+2)-1........ A202876....... A202877
F(n+3)-2........ A202970....... A202971
(F(n))^2........ A203001....... A203002
(F(n+1))^2...... A203003....... A203004
C(2n,n)......... A115255....... A203005
(-1)^(n+1)...... A003983....... A076757
periodic 1,0.... A203905....... A203906
periodic 1,0,0.. A203945....... A203946
periodic 1,0,1.. A203947....... A203948
periodic 1,1,0.. A203949....... A203950
periodic 1,0,0,0 A203951....... A203952
periodic 1,2.... A203953....... A203954
periodic 1,2,3.. A203955....... A203956
...
In the cases listed above, the zeros of the characteristic polynomials are positive. If more general symmetric matrices are used, the zeros are all real but not necessarily positive - but they do have the interlace property. For a guide to such matrices and polynomials, see A202605.

Examples

			The 1st principal submatrix (ps) of A202453 is {{1}} (using Mathematica matrix notation), with p(1) = 1-x and zero-set {1}.
...
The 2nd ps is {{1,1},{1,2}}, with p(2) = 1-3x+x^2 and zero-set {0.382..., 2.618...}.
...
The 3rd ps is {{1,1,2},{1,2,3},{2,3,6}}, with p(3) = 1-6x+9x^2-x^3 and zero-set {0.283..., 0.426..., 8.290...}.
  ...
Top of the array A202605:
  1,   -1;
  1,   -3,    1;
  1,   -6,    9,   -1;
  1,   -9,   26,  -24,    1;
  1,  -12,   52,  -96,   64,   -1;
  1,  -15,   87, -243,  326, -168,    1;
		

Crossrefs

Programs

  • Mathematica
    f[k_] := Fibonacci[k];
    U[n_] := NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[Table[f[k], {k, 1, n}]];
    L[n_] := Transpose[U[n]];
    F[n_] := CharacteristicPolynomial[L[n].U[n], x];
    c[n_] := CoefficientList[F[n], x]
    TableForm[Flatten[Table[F[n], {n, 1, 10}]]]
    Table[c[n], {n, 1, 12}]
    Flatten[%]
    TableForm[Table[c[n], {n, 1, 10}]]

A115262 Correlation triangle for n+1.

Original entry on oeis.org

1, 2, 2, 3, 5, 3, 4, 8, 8, 4, 5, 11, 14, 11, 5, 6, 14, 20, 20, 14, 6, 7, 17, 26, 30, 26, 17, 7, 8, 20, 32, 40, 40, 32, 20, 8, 9, 23, 38, 50, 55, 50, 38, 23, 9, 10, 26, 44, 60, 70, 70, 60, 44, 26, 10, 11, 29, 50, 70, 85, 91, 85, 70, 50, 29, 11
Offset: 0

Views

Author

Paul Barry, Jan 18 2006

Keywords

Comments

This sequence (formatted as a square array) gives the counts of all possible squares in an m X n rectangle. For example, 11 = 8 (1 X 1 squares) + 3 (2 X 2 square) in 4 X 2 rectangle. - Philippe Deléham, Nov 26 2009
From Clark Kimberling, Feb 07 2011: (Start)
Also the accumulation array of min{n,k}, when formatted as a rectangle.
This is the accumulation array of the array M=A003783 given by M(n,k)=min{n,k}; see A144112 for the definition of accumulation array.
The accumulation array of A115262 is A185957. (End)
From Clark Kimberling, Dec 22 2011: (Start)
As a square matrix, A115262 is the self-fusion matrix of A000027 (1,2,3,4,...). See A193722 for the definition of fusion and A202673 for characteristic polynomials associated with A115622. (End)

Examples

			Triangle begins
  1;
  2,  2;
  3,  5,  3;
  4,  8,  8,  4;
  5, 11, 14, 11,  5;
  6, 14, 20, 20, 14,  6;
  ...
When formatted as a square matrix:
  1,  2,  3,  4,  5, ...
  2,  5,  8, 11, 14, ...
  3,  8, 14, 20, 26, ...
  4, 11, 20, 30, 40, ...
  5, 14, 26, 40, 55, ...
  ...
		

Crossrefs

For the triangular version: row sums are A001752. Diagonal sums are A097701. T(2n,n) is A000330(n+1).
Diagonals (1,5,...): A000330 (square pyramidal numbers),
diagonals (2,8,...): A007290,
diagonals (3,11,...): A051925,
diagonals (4,14,...): A159920,
antidiagonal sums: A001752.

Programs

  • Mathematica
    U = NestList[Most[Prepend[#, 0]] &, #, Length[#] - 1] &[Table[k, {k, 1, 12}]];
    L = Transpose[U]; M = L.U; TableForm[M]
    m[i_, j_] := M[[i]][[j]];
    Flatten[Table[m[i, n + 1 - i], {n, 1, 12}, {i, 1, n}]]
    (* Clark Kimberling, Dec 22 2011 *)

Formula

Let f(m,n) = m*(m-1)*(3*n-m-1)/6. This array is (with a different offset) the infinite square array read by antidiagonals U(m,n) = f(n,m) if m < n, U(m,n) = f(m,n) if m <= n. See A271916. - N. J. A. Sloane, Apr 26 2016
G.f.: 1/((1-x)^2*(1-x*y)^2*(1-x^2*y)).
Number triangle T(n, k) = Sum_{j=0..n} [j<=k]*(k-j+1)[j<=n-k]*(n-k-j+1).
T(2n,n) - T(2n,n+1) = n+1.

A003982 Table read by rows: 1 if x = y, 0 otherwise, where (x,y) = (0,0),(0,1),(1,0),(0,2),(1,1),(2,0),...

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Keywords

Comments

Also called the delta function.
From Clark Kimberling, Feb 07 2011: (Start)
In rectangular format, the infinite identity matrix and the weight array of A003783(n,k)=min{n,k}; in the accumulation chain
... < A003982 < A003783 < A115262 < A185957 < ... . See A144112 for definitions of weight array and accumulation array. (End)

Examples

			Table begins
  1;
  0, 0;
  0, 1, 0;
  0, 0, 0, 0;
  0, 0, 1, 0, 0;
  ....
Northwest corner when formatted as a rectangular array:
  1 0 0 0 0 0 0 0
  0 1 0 0 0 0 0 0
  0 0 1 0 0 0 0 0
  0 0 0 1 0 0 0 0
  0 0 0 0 1 0 0 0
		

Crossrefs

Characteristic function of A001844. Antidiagonal sums and main diagonal is A000012.
Cf. also A286100.

Programs

  • Mathematica
    f[n_,k_]:=0; f[n_,n_]:=1;
    TableForm[Table[f[n,k],{n,1,10},{k,1,10}]] (* array *)
    Table[f[n-k+1,k],{n,10},{k,n,1,-1}]//Flatten (*sequence *)
    Table[Join[{1},Table[0,4n-1]],{n,10}]//Flatten (* Harvey P. Dale, Dec 21 2016 *)
  • PARI
    {a(n) = issquare(2*n + 1)}; /* Michael Somos, Apr 13 2005 */
    
  • PARI
    {a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^8 + A)^2 / eta(x^4 + A), n))};
    
  • PARI
    A(i,j)=i==j

Formula

n-th 1 is followed by 4*n-1 0's. In the sequence with flattened indices, the 1's are at positions listed in A046092.
G.f.: 1/(1 - x*y). E.g.f.: exp(x*y).
Considered as a linear sequence, expansion of q^(-1/2)*eta(q^8)^2/eta(q^4) in powers of q. If A(x) is the g.f., then B(a) = (q*A(a^2))^2 satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u^2*w - v^3 - 4*v*w^2. Also, given g.f. A(x), then B(q) = q*A(q^2) satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1*u2^2*u6 - u1*u6^3 - u3^3*u2. - Michael Somos, Apr 13 2005
a(n) = b(2*n + 1) where b(n) is multiplicative and b(2^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 if p>2. - Michael Somos, Jun 06 2005
a(n) = floor(sqrt(2*n+1)) - floor(sqrt(2*n)). - Ridouane Oudra, Oct 09 2020
Showing 1-4 of 4 results.