login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 106784, 56850678464, 32898111133723321, 19096119789145305208336, 11085838411090123868197412129, 6435670258948861016802884153464799, 3736105167546089403361511734752297982336, 2168924345573542197211153077794030841411079321 (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

Table of n, a(n) for n=0..8.

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

CROSSREFS

Sequence in context: A237081 A253404 A223343 * A157105 A122711 A297994

Adjacent sequences:  A028463 A028464 A028465 * A028467 A028468 A028469

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

a(8) from Alois P. Heinz, Dec 10 2013

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 June 20 20:36 EDT 2021. Contains 345235 sequences. (Running on oeis4.)