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

 

Logo

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!)
A028465 Number of perfect matchings in graph C_{3} X C_{4} X P_{n}. 1
1, 50, 13680, 2758784, 594171481, 126820978560, 27131807289745, 5803101986080736, 1241308675434652080, 265520025152559669938, 56795817642070468777849, 12148857852574217536512768, 2598690860121381846094850953, 555870713538432221246960384114 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..200

Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.

CROSSREFS

Sequence in context: A276102 A152258 A203097 * A252630 A034205 A173170

Adjacent sequences:  A028462 A028463 A028464 * A028466 A028467 A028468

KEYWORD

nonn

AUTHOR

Per H. Lundow

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 02:18 EST 2020. Contains 338921 sequences. (Running on oeis4.)