|
%I #22 May 07 2018 03:37:14
%S 1,89,78243,47177097,30734932553,19711134149599,12688781322524383,
%T 8160498611028648795,5249581929453966097649,3376771882017849561260401,
%U 2172138783673094193937750015,1397239543795157686038029989037,898783117890438425073750503319527
%N Number of matchings in graph P_{10} X P_{n}.
%H Alois P. Heinz, <a href="/A033513/b033513.txt">Table of n, a(n) for n = 0..350</a>
%H Burton S. Kaliski Jr, <a href="https://arxiv.org/abs/1711.02491">Targeted Fibonacci Exponentiation</a>, arXiv preprint arXiv:1711.02491 [math.NT], 2017.
%H 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 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y Column k=10 of A210662.
%K nonn
%O 0,2
%A _Per H. Lundow_
|
