1,1

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.

P. Raff, Table of n, a(n) for n = 1..200

F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.

F. Faase, Counting Hamilton cycles in product graphs

F. Faase, Results from the counting program

F. Faase, Counting Hamilton cycles in product graphs

P. Raff, Spanning Trees in Grid Graphs. [Paul Raff (paul(AT)myraff.com), Oct 29, 2009]

P. Raff, Analysis of the Number of Spanning Trees of W_5 x P_n. Contains sequence, recurrence, generating function, and more. [Paul Raff (paul(AT)myraff.com), Oct 29, 2009]

P. Raff, Analysis of the Number of Spanning Trees of Grid Graphs. [Paul Raff (paul(AT)myraff.com), Oct 29, 2009]

Index entries for sequences related to trees

a(n) = 1152 a(n-1)

- 80640 a(n-2)

+ 1442883 a(n-3)

- 4477824 a(n-4)

+ 4477824 a(n-5)

- 1442883 a(n-6)

+ 80640 a(n-7)

- 1152 a(n-8)

+ a(n-9)

G.f.: -45x(x^7+73x^6-3456x^5+4534x^4+4534x^3-3456x^2+73x+1)/(x^9-1152x^8+80640x^7-1442883x^6+4477824x^5-4477824x^4+1442883x^3-80640x^2+1152x-1)

Sequence in context: A101994 A007537 A125113 this_sequence A145319 A089626 A110479

Adjacent sequences: A003736 A003737 A003738 this_sequence A003740 A003741 A003742

nonn,easy,mult

Frans Faase (Frans_LiXia(AT)wxs.nl)

Added recurrence from Faase's web page. - N. J. A. Sloane (njas(AT)research.att.com), Feb 03 2009