Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A028446
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A028446 Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}. +0
1
9, 5051532105 (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.

CROSSREFS

Sequence in context: A131678 A029983 A154110 this_sequence A058470 A058434 A067487

Adjacent sequences: A028443 A028444 A028445 this_sequence A028447 A028448 A028449

KEYWORD

nonn,bref,more

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research