OFFSET
1,3
COMMENTS
This is a companion entry to A318243 and uses an inclusion-exclusion method on the matching numbers given there.
This is also the number of "1-domino" configurations in the game of memory played on a 2 X n rectangular array, see [Young]. - Donovan Young, Oct 23 2018
LINKS
D. Young, The Number of Domino Matchings in the Game of Memory, Journal of Integer Sequences, Vol. 21 (2018), Article 18.8.1.
Donovan Young, Generating Functions for Domino Matchings in the 2 * k Game of Memory, arXiv:1905.13165 [math.CO], 2019. Also in J. Int. Seq., Vol. 22 (2019), Article 19.8.7.
FORMULA
a(n) = Sum_{k=0..n-1} (-1)^k*(2*n-2*k-3)!! * A318243(n,k) where and 0!! = (-1)!! = 1; proved by inclusion-exclusion.
EXAMPLE
For the case n = 2, if one pair is joined by an edge, then the remaining pair is forced to be joined by the remaining edge. Thus a(2) = 0.
CROSSREFS
KEYWORD
nonn
AUTHOR
Donovan Young, Aug 22 2018
STATUS
approved