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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028466 Number of perfect matchings in graph C_{3} X C_{5} X P_{2n}. 0
106784, 56850678464, 32898111133723321, 19096119789145305208336, 11085838411090123868197412129, 6435670258948861016802884153464799, 3736105167546089403361511734752297982336 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

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

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

CROSSREFS

Sequence in context: A025290 A184649 A184646 * A157105 A122711 A061332

Adjacent sequences:  A028463 A028464 A028465 * A028467 A028468 A028469

KEYWORD

nonn

AUTHOR

Per Hakan Lundow (phl(AT)theophys.kth.se)

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 09:27 EST 2012. Contains 205904 sequences.