|
%I #27 May 04 2021 03:11:16
%S 1,151316,9411975375,490179860527896,24080189412483072000,
%T 1154617875754582889149500,54740416599810921320592441119,
%U 2580716459066338161324165906475056,121316352059447360262303173959408358625,5694319004079097795957215725765328371712000
%N Number of spanning trees in the graph P_10 x P_n.
%H Seiichi Manyama, <a href="/A334005/b334005.txt">Table of n, a(n) for n = 1..200</a>
%F See _Peter Bala_'s formula in A116469.
%t a[n_] := Resultant[ChebyshevU[n - 1, x/2], ChebyshevU[9, (4 - x)/2], x]; Array[a, 10] (* _Amiram Eldar_, May 04 2021 *)
%o (PARI) {a(n) = polresultant(polchebyshev(n-1, 2, x/2), polchebyshev(9, 2, (4-x)/2))}
%Y Row m=10 of A116469.
%K nonn
%O 1,2
%A _Seiichi Manyama_, Apr 12 2020
|
