A334003 Number of spanning trees in the graph P_8 x P_n.

1, 10864, 59817135, 289143013376, 1342421467113969, 6136973985625588560, 27873182693625548898079, 126231322912498539682594816, 570929651486775190858844600865, 2580716459066338161324165906475056, 11662182187505395757590783332919031887

Offset

1,2

Links

Seiichi Manyama, Table of n, a(n) for n = 1..200

Index entries for linear recurrences with constant coefficients, order 128.

Formula

See Peter Bala's formula in A116469.

Mathematica

a[n_] := Resultant[ChebyshevU[n - 1, x/2], ChebyshevU[7, (4 - x)/2], x]; Array[a, 11] (* Amiram Eldar, May 04 2021 *)

Prog

(PARI) {a(n) = polresultant(polchebyshev(n-1, 2, x/2), polchebyshev(7, 2, (4-x)/2))}

Crossrefs

Row m=8 of A116469.

Sequence in context: A295993 A185517 A250954 * A214243 A250896 A164824

Adjacent sequences: A334000 A334001 A334002 * A334004 A334005 A334006

Keyword

nonn,changed

Author

Seiichi Manyama, Apr 12 2020

Status

approved