Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049507
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049507 Number of perfect matchings in graph P_{6} x P_{6} x P_{n}. +0
1
6728, 53786626921, 57248060375968384, 123115692449982216049513, 216388579168758145017797108072 (list; graph; listen)
OFFSET

0,1

REFERENCES

P. H. Lundow, Computation of matching polynomials and the number of 1-factors in polygraphs.

LINKS

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

CROSSREFS

Adjacent sequences: A049504 A049505 A049506 this_sequence A049508 A049509 A049510

Sequence in context: A028543 A099778 A035905 this_sequence A064160 A031986 A031832

KEYWORD

nonn

AUTHOR

P. H. Lundow

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research