Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A028453
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A028453
%S A028453 11,1845,117805,10885344,858626465,72926048233,5978148553531,
%T A028453 498776151252389,41250197689850048,3426717195626372141,
%U A028453 284023348462456779971,23568180558085521390777
%N A028453 Number of perfect matchings in graph P_{3} X P_{4} X P_{n}.
%D A028453 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.
%H A028453 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">
               Enumeration of matchings in polygraphs</a>, 1998.
%Y A028453 Sequence in context: A076168 A053884 A027880 this_sequence A024151 A114354 
               A167249
%Y A028453 Adjacent sequences: A028450 A028451 A028452 this_sequence A028454 A028455 
               A028456
%K A028453 nonn
%O A028453 1,1
%A A028453 Per Hakan Lundow (phl(AT)theophys.kth.se)

    
page 1

Search completed in 0.001 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research