Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A028473
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A028473 Number of perfect matchings in graph P_{11} X P_{n}. +0
2
144, 51205, 21001799, 8940739824, 3852472573499, 1666961188795475, 722364079570222320, 313196612952258199679, 135818983640055277506397, 58902468764522025160456848, 25545661075321867247577262777 (list; graph; listen)
OFFSET

1,1

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

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

Vladeta Jovovic, Explicit formula, generating function and recurrence

CROSSREFS

Row 11 of array A099390.

Sequence in context: A055352 A079658 A091037 this_sequence A130118 A159724 A008700

Adjacent sequences: A028470 A028471 A028472 this_sequence A028474 A028475 A028476

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research