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.

A288458 Chebyshev coefficients of density of states of cubic lattice.

Original entry on oeis.org

1, -24, 288, -2688, -32256, 2820096, -95035392, 1972076544, -9841803264, -1288894414848, 70351960670208, -2164060518875136, 36664809432809472, 365875642245316608, -55960058736918134784, 2436570173137823465472, -64272155689216515244032, 664295705652718630600704, 35692460661517822602510336
Offset: 0

Views

Author

Yen-Lee Loh, Jun 16 2017

Keywords

Comments

This is the sequence of integers z^n g_n for n=0,2,4,6,... where g_n are the coefficients in the Chebyshev polynomial expansion of the density of states of the simple cubic lattice (z=6), g(w) = 1 / (Pi*sqrt(1-w^2)) * Sum_{n>=0} (2-delta_n) g_n T_n(w). Here |w| <= 1 and delta is the Kronecker delta.
The Chebyshev coefficients, g_n, are related to the number of walks on the lattice that return to the origin, W_n, as g_n = Sum_{k=0..n} a_{nk} z^{-k} W_k, where z is the coordination number of the lattice and a_{nk} are the coefficients of Chebyshev polynomials such that T_n(x) = Sum_{k=0..n} a_{nk} x^k.
The author was unable to obtain a closed form for z^n g_n.

Crossrefs

Related to numbers of walks returning to origin, W_n, on cubic lattice (A002896).

Programs

  • Mathematica
    Whon[n_] := If[OddQ[n], 0,
       Sum[Binomial[n/2,j]^2 Binomial[2j,j], {j, 0, n/2}]];
    Wcub[n_] := Binomial[n, n/2] Whon[n];
    ank[n_, k_] := SeriesCoefficient[ChebyshevT[n, x], {x, 0, k}];
    zng[n_] := Sum[ank[n, k]*6^(n-k)*Wcub[k], {k, 0, n}];
    Table[zng[n], {n,0,50}]