|
| |
|
|
A334005
|
|
Number of spanning trees in the graph P_10 x P_n.
|
|
3
|
|
|
|
1, 151316, 9411975375, 490179860527896, 24080189412483072000, 1154617875754582889149500, 54740416599810921320592441119, 2580716459066338161324165906475056, 121316352059447360262303173959408358625, 5694319004079097795957215725765328371712000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Seiichi Manyama, Table of n, a(n) for n = 1..200
|
|
|
FORMULA
|
See Peter Bala's formula in A116469.
|
|
|
MATHEMATICA
|
a[n_] := Resultant[ChebyshevU[n - 1, x/2], ChebyshevU[9, (4 - x)/2], x]; Array[a, 10] (* Amiram Eldar, May 04 2021 *)
|
|
|
PROG
|
(PARI) {a(n) = polresultant(polchebyshev(n-1, 2, x/2), polchebyshev(9, 2, (4-x)/2))}
|
|
|
CROSSREFS
|
Row m=10 of A116469.
Sequence in context: A246285 A344940 A344941 * A251987 A205662 A205951
Adjacent sequences: A334002 A334003 A334004 * A334006 A334007 A334008
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Seiichi Manyama, Apr 12 2020
|
|
|
STATUS
|
approved
|
| |
|
|
