Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033520
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033520 Number of matchings in graph C_{8} X P_{n} +0
1
47, 11396, 2217871, 447264801, 89761235312, 18027314711921, 3620162014192047, 726995373373259268, 145993770068726584623, 29318189070923580394385, 5887622256467996898381824 (list; graph; listen)
OFFSET

0,1

REFERENCES

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

LINKS

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

CROSSREFS

Sequence in context: A123798 A104069 A101629 this_sequence A093940 A087533 A023935

Adjacent sequences: A033517 A033518 A033519 this_sequence A033521 A033522 A033523

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research