|
(PARI) {a(n) = polresultant(polchebyshev(n-1, 2, x/2), polchebyshev(8, 2, (4-x)/2))}
(Python)
# Using graphillion
from graphillion import GraphSet
import graphillion.tutorial as tl
def A116469(n, k):
if n == 1 or k == 1: return 1
universe = tl.grid(n - 1, k - 1)
GraphSet.set_universe(universe)
spanning_trees = GraphSet.trees(is_spanning=True)
return spanning_trees.len()
def A334004(n):
return A116469(n, 9)
print([A334004(n) for n in range(1, 10)])
| 