Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033522
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033522 Number of matchings in graph C_{10} X P_{n} +0
1
123, 117732, 85579087, 65035723280, 49125060601108, 37140865202938885, 28076586641702173315, 21224865471367565301932, 16045172079162180370051008, 12129530424108426130365136337 (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: A095761 A121917 A049670 this_sequence A080537 A030492 A031203

Adjacent sequences: A033519 A033520 A033521 this_sequence A033523 A033524 A033525

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research