login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028467 Number of perfect matchings in graph C_{4} X C_{4} X P_{n}. 0
1, 272, 589185, 930336768, 1545853411969, 2551276235535120, 4215052025641922305, 6962828841161217269760, 11502121570585083415761153, 19000667589592082076903397136, 31387734017421172152812450818177, 51850272028503475884947837964718080 (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..11.

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

CROSSREFS

Sequence in context: A225833 A198289 A198595 * A203758 A028679 A043596

Adjacent sequences:  A028464 A028465 A028466 * A028468 A028469 A028470

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

a(10)-a(11) 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 16:23 EDT 2022. Contains 357090 sequences. (Running on oeis4.)