read `SpanningTrees.txt`: 

N:=6:

for n from 2 to N do

G:={seq({i,i+1},i=1..n-1)}:

print(`G is`, G):

gu:=SeqST(G,n,max(2^(n+1)+2,20)):

print(`The first 20 terms of the sequence enumerating spanning trees of Gx{1,...,N1} are`):
print(``):
print(op(1..20,gu)):
print(``):

lu:=GuessRGF(gu,t):

if lu<>FAIL then
print(``):
print(`The generating function, in t, is `):
print(``):
print(lu):
print(``):
print(`and in Maple format`):
print(``):
lprint(lu):
print(``):
fi:

od:

print(``):
print(`---------------------------------------------------`):
print(``):
print(`This took`, time(), `seconds. `):


quit: