Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033519
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033519 Number of matchings in graph C_{7} X P_{n} +0
1
29, 3544, 356863, 37071837, 3834744194, 396924243197, 41080815923665, 4251834519798256, 440060916969339903, 45545908457817115829, 4713960298263277400742, 487890626842308225478637 (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: A055559 A144233 A125074 this_sequence A103656 A028459 A127425

Adjacent sequences: A033516 A033517 A033518 this_sequence A033520 A033521 A033522

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