cp's OEIS Frontend

A033507 Number of matchings in graph P_{4} X P_{n}.

%I A033507 #44 Sep 08 2022 08:44:51
%S A033507 1,5,71,823,10012,120465,1453535,17525619,211351945,2548684656,
%T A033507 30734932553,370635224561,4469527322891,53898461609719,
%U A033507 649966808093412,7838012982224913,94519361817920403,1139818186429110279,13745178487929574337,165754445655292452448
%N A033507 Number of matchings in graph P_{4} X P_{n}.
%D A033507 H. Hosoya and A. Motoyama, An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices, J. Math. Phys., 26(1985), 157-167.
%H A033507 Alois P. Heinz, <a href="/A033507/b033507.txt">Table of n, a(n) for n = 0..500</a>
%H A033507 David Friedhelm Kind, <a href="https://doi.org/10.13140/RG.2.2.11182.54086">The Gunport Problem: An Evolutionary Approach</a>, De Montfort University (Leicester, UK, 2020).
%H A033507 Per Hakan 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, No 12, 1996, Department of Math., Umea University, Sweden.
%H A033507 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%H A033507 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9,41,-41,-111,91,29,-23,-1,1).
%F A033507 From _Sergey Perepechko_, Apr 24 2013: (Start)
%F A033507 a(n) = 9*a(n-1) +41*a(n-2) -41*a(n-3) -111*a(n-4) +91*a(n-5) +29*a(n-6) -23*a(n-7) -a(n-8) +a(n-9).
%F A033507 G.f.: (1-x) * (1 -3*x -18*x^2 +2*x^3 +12*x^4 +x^5 -x^6) / (1 -9*x -41*x^2 +41*x^3 +111*x^4 -91*x^5 -29*x^6 +23*x^7 +x^8 -x^9). (End)
%e A033507 a(1) = 5: the graph is
%e A033507 . o-o-o-o
%e A033507 and the five matchings are
%e A033507 . o o o o
%e A033507 . o-o o o
%e A033507 . o o-o o
%e A033507 . o o o-o
%e A033507 . o-o o-o
%p A033507 a:=array(0..20,[1, 5, 71, 823, 10012, 120465, 1453535, 17525619, 211351945]):
%p A033507 for j from 9 to 20 do
%p A033507   a[j]:=9*a[j-1]+41*a[j-2]-41*a[j-3]-111*a[j-4]+91*a[j-5]+
%p A033507         29*a[j-6]-23*a[j-7]-a[j-8]+a[j-9]
%p A033507 od:
%p A033507 convert(a,list);
%p A033507 # _Sergey Perepechko_, Apr 24 2013
%t A033507 LinearRecurrence[{9,41,-41,-111,91,29,-23,-1,1},{1,5,71,823,10012,120465, 1453535,17525619,211351945},30] (* _Harvey P. Dale_, Mar 27 2015 *)
%o A033507 (PARI) my(x='x+O('x^30)); Vec((1-x)*(1 -3*x-18*x^2+2*x^3+12*x^4+x^5-x^6)/(1-9*x-41*x^2+41*x^3+111*x^4-91*x^5 -29*x^6+23*x^7+x^8-x^9)) \\ _G. C. Greubel_, Oct 26 2019
%o A033507 (Magma) R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1-x)*(1 -3*x-18*x^2+2*x^3+12*x^4+x^5-x^6)/(1-9*x-41*x^2+41*x^3+111*x^4-91*x^5 -29*x^6+23*x^7+x^8-x^9) )); // _G. C. Greubel_, Oct 26 2019
%o A033507 (Sage)
%o A033507 def A033507_list(prec):
%o A033507     P.<x> = PowerSeriesRing(ZZ, prec)
%o A033507     return P( (1-x)*(1 -3*x-18*x^2+2*x^3+12*x^4+x^5-x^6)/(1-9*x-41*x^2+41*x^3+111*x^4-91*x^5 -29*x^6+23*x^7+x^8-x^9) ).list()
%o A033507 A033507_list(30) # _G. C. Greubel_, Oct 26 2019
%o A033507 (GAP) a:=[1,5,71,823,10012,120465, 1453535,17525619,211351945];; for n in [10..30] do a[n]:=9*a[n-1]+41*a[n-2]-41*a[n-3]-111*a[n-4]+91*a[n-5] +29*a[n-6]-23*a[n-7]-a[n-8]+a[n-9]; od; a; # _G. C. Greubel_, Oct 26 2019
%Y A033507 Column 4 of triangle A210662. Row sums of A100265.
%Y A033507 For perfect matchings see A005178.
%Y A033507 Cf. A033508-A033511.
%Y A033507 Bisection (even part) gives A260034.
%K A033507 nonn
%O A033507 0,2
%A A033507 _Per H. Lundow_
%E A033507 Edited by _N. J. A. Sloane_, Nov 15 2009