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.

A341502 Number of matchings in the 3 X n rook graph.

This page as a plain text file.
%I A341502 #10 Mar 14 2021 00:47:01
%S A341502 1,4,32,370,5950,122984,3175696,98815588,3638940860,155377163440,
%T A341502 7598445388096,420034502219864,26014375783223272,1788772035008337760,
%U A341502 135644687161742899520,11268192704027639350384,1020100484786824631520016,100126060947226759050509888
%N A341502 Number of matchings in the 3 X n rook graph.
%H A341502 Andrew Howroyd, <a href="/A341502/b341502.txt">Table of n, a(n) for n = 0..100</a>
%F A341502 a(n) = Sum{i,j,k>=0, i+j+k<=n} n!/(i!*j!*k!*(n-i-j-k)!) * A000085(n-i-j) * A000085(n-i-k) * A000085(n-j-k).
%o A341502 (PARI) \\ here b(n) is A000085.
%o A341502 b(n)={sum(k=0, n\2, n!/((n-2*k)!*2^k*k!))}
%o A341502 a(n)={my(v=vector(n+1, i, b(i-1))); sum(i=0,n, sum(j=0, n-i, sum(k=0, n-i-j, n!/(i!*j!*k!*(n-i-j-k)!)*v[1+n-i-j]*v[1+n-i-k]*v[1+n-j-k] )))}
%Y A341502 Row 3 of A270227.
%Y A341502 Cf. A000085, A341848, A341851.
%K A341502 nonn
%O A341502 0,2
%A A341502 _Andrew Howroyd_, Feb 21 2021