|
%I #10 Nov 21 2013 07:01:00
%S 0,2,6,16,38,98,244,614,1542,3872,9726,24426,61348,154078,386974,
%T 971904,2440982,6130642,15397396,38671286,97124758,243933408,
%U 612650254,1538699994,3864517572,9705918062,24376870766,61223660096,153766108518
%N Number of nX2 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..1 nX2 array
%C Also, number of maximal independent sets in the 3-dimensional (2, 2, n) grid graph. [Euler et al.] - _N. J. A. Sloane_, Nov 21 2013
%C Column 2 of A217637.
%H R. H. Hardin, <a href="/A217631/b217631.txt">Table of n, a(n) for n = 0..210</a>
%H R. Euler, P. Oleksik, Z. Skupien, <a href="http://dx.doi.org/10.7151/dmgt.1707">Counting Maximal Distance-Independent Sets in Grid Graphs</a>, Discussiones Mathematicae Graph Theory. Volume 33, Issue 3, Pages 531-557, ISSN (Print) 2083-5892, July 2013; http://www.degruyter.com/view/j/dmgt.2013.33.issue-3/dmgt.1707/dmgt.1707.xml
%F G.f. = (2*x+4*x^2+4*x^3)/(1-x-3*x^2-2*x^3). [Euler et al.] - _N. J. A. Sloane_, Nov 21 2013
%F Empirical: a(n) = a(n-1) + 3*a(n-2) + 2*a(n-3). (Follows from g.f. - _N. J. A. Sloane_, Nov 21 2013)
%e Some solutions for n=3
%e ..0..0....0..0....0..0....1..1....0..0....1..0....1..0....0..1....1..1....0..0
%e ..0..1....0..0....0..1....0..1....1..0....0..0....0..0....0..0....1..1....1..0
%e ..0..0....1..0....1..1....0..0....0..0....0..0....1..0....0..1....1..1....1..1
%Y Cf. A217632, A217637.
%K nonn
%O 0,2
%A _R. H. Hardin_ Oct 09 2012
|
