cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A049507 Number of perfect matchings in graph P_{6} x P_{6} x P_{n}.

This page as a plain text file.
%I A049507 #11 Feb 17 2020 04:05:27
%S A049507 1,6728,53786626921,57248060375968384,123115692449982216049513,
%T A049507 216388579168758145017797108072
%N A049507 Number of perfect matchings in graph P_{6} x P_{6} x P_{n}.
%H A049507 P. H. Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors.pdf">Computation of matching polynomials and the number of 1-factors in polygraphs</a>, Research report #12 (1996).
%H A049507 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y A049507 Cf. A006253, A028452, A028454.
%K A049507 nonn,more
%O A049507 0,2
%A A049507 _Per H. Lundow_