login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092136 Number of spanning trees in S_5 x P_n. 1
1, 189, 24576, 3046869, 375175625, 46151368704, 5676383392121, 698151521972709, 85867005969063936, 10560944392853518125, 1298910307853115410641, 159755407182415993503744 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

F. Faase, Counting Hamilton cycles in product graphs

P. Raff, Spanning Trees in Grid Graphs.

P. Raff, Analysis of the Number of Spanning Trees of S_5 x P_n. Contains sequence, recurrence, generating function, and more.

P. Raff, Analysis of the Number of Spanning Trees of Grid Graphs.

FORMULA

a(n) = 144*a(n-1) - 2640*a(n-2) + 6930*a(n-3) - 2640*a(n-4) + 144*a(n-5) - a(n-6). [Modified by Paul Raff, Oct 30, 2009]

G.f.: -x*(x^4 + 45*x^3 - 45*x-1)/(x^6 - 144*x^5 + 2640*x^4 - 6930*x^3 + 2640*x^2 - 144*x + 1). - Paul Raff (paul(AT)myraff.com), Mar 07 2009

a(n) = A004187(n)*(A001906(n))^3 = A004187(n)*A001906(n)*A049684(n). [See R. Guy, seqfan list, Mar 28 2009] - R. J. Mathar, Jun 03 2009

MATHEMATICA

LinearRecurrence[{7, -1}, {0, 1}, 13] LinearRecurrence[{3, -1}, {0, 1}, 13]^3 // Rest (* Jean-Fran├žois Alcover, Oct 30 2018, after R. J. Mathar *)

CROSSREFS

Sequence in context: A267993 A286791 A076012 * A259166 A156741 A138730

Adjacent sequences:  A092133 A092134 A092135 * A092137 A092138 A092139

KEYWORD

nonn

AUTHOR

Ralf Stephan, Mar 28 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 09:49 EST 2018. Contains 317182 sequences. (Running on oeis4.)