The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145409 Number of perfect matchings (or domino tilings) in K_6 X P_n. 0
 15, 376, 8805, 207901, 4903920, 115686901, 2729093235, 64380355576, 1518756918825, 35828050696201, 845197277027040, 19938523685081401, 470357320740846855, 11095907233164566776, 261756651587724670845 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154. LINKS 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, Results from the counting program FORMULA Recurrence: a(1) = 15, a(2) = 376, a(3) = 8805, a(4) = 207901, and a(n) = 21a(n-1) + 62a(n-2) - 21a(n-3) - a(n-4). G.f.: x(15+61x-21x^2-x^3)/(1-21x-62x^2+21x^3+x^4). - R. J. Mathar, Feb 19 2009 CROSSREFS Sequence in context: A087330 A035274 A324415 * A164323 A129615 A286139 Adjacent sequences:  A145406 A145407 A145408 * A145410 A145411 A145412 KEYWORD nonn AUTHOR N. J. A. Sloane, Feb 03 2009 EXTENSIONS More terms from R. J. Mathar, Feb 19 2009 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 07:17 EST 2020. Contains 338632 sequences. (Running on oeis4.)