The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A318244

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A318244

a(n) is the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that only one such pair is joined by an edge.
(history; published version)

#29 by Andrew Howroyd at Wed Mar 18 11:06:32 EDT 2020

STATUS

reviewed

approved

#28 by Michel Marcus at Wed Mar 18 10:04:17 EDT 2020

STATUS

proposed

reviewed

#27 by Michael De Vlieger at Wed Mar 18 10:03:46 EDT 2020

STATUS

editing

proposed

#26 by Michael De Vlieger at Wed Mar 18 10:03:45 EDT 2020

LINKS

Donovan Young, <a href="https://arxiv.org/abs/1905.13165">Generating Functions for Domino Matchings in the 2 * k Game of Memory</a>, arXiv:1905.13165 [math.CO], 2019. Also in <a href="https://www.emis.de/journals/JIS/VOL22/Young/young13.html">J. Int. Seq.</a>, Vol. 22 (2019), Article 19.8.7.

STATUS

approved

editing

#25 by Susanna Cuyler at Wed Jul 10 21:22:59 EDT 2019

STATUS

proposed

approved

#24 by Michael De Vlieger at Wed Jul 10 17:12:08 EDT 2019

STATUS

editing

proposed

#23 by Michael De Vlieger at Wed Jul 10 17:12:06 EDT 2019

LINKS

D. Young, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL21/Young/young2.html">The Number of Domino Matchings in the Game of Memory</a>, Journal of Integer Sequences, Vol. 21 (2018), Article 18.8.1.

Donovan Young, <a href="https://arxiv.org/abs/1905.13165">Generating Functions for Domino Matchings in the 2 * k Game of Memory</a>, arXiv:1905.13165 [math.CO], 2019.

STATUS

approved

editing

#22 by Bruno Berselli at Tue Oct 23 05:48:06 EDT 2018

STATUS

reviewed

approved

#21 by Michel Marcus at Tue Oct 23 04:58:50 EDT 2018

STATUS

proposed

reviewed

#20 by Donovan Young at Tue Oct 23 04:24:51 EDT 2018

STATUS

editing

proposed