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.

A334005 Number of spanning trees in the graph P_10 x P_n.

Original entry on oeis.org

1, 151316, 9411975375, 490179860527896, 24080189412483072000, 1154617875754582889149500, 54740416599810921320592441119, 2580716459066338161324165906475056, 121316352059447360262303173959408358625, 5694319004079097795957215725765328371712000
Offset: 1

Views

Author

Seiichi Manyama, Apr 12 2020

Keywords

Crossrefs

Row m=10 of A116469.

Programs

  • Mathematica
    a[n_] := Resultant[ChebyshevU[n - 1, x/2], ChebyshevU[9, (4 - x)/2], x]; Array[a, 10] (* Amiram Eldar, May 04 2021 *)
  • PARI
    {a(n) = polresultant(polchebyshev(n-1, 2, x/2), polchebyshev(9, 2, (4-x)/2))}

Formula

See Peter Bala's formula in A116469.