login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of n-element 0..2 arrays with each element the minimum of 3 adjacent elements of a random 0..2 array of n+2 elements.
3

%I #12 Feb 23 2018 11:28:51

%S 3,9,22,46,91,183,383,819,1749,3699,7772,16316,34325,72349,152573,

%T 321621,677623,1427389,3006930,6335210,13348399,28125235,59258363,

%U 124851495,263048937,554220135,1167698552,2460253944,5183565225,10921353721

%N Number of n-element 0..2 arrays with each element the minimum of 3 adjacent elements of a random 0..2 array of n+2 elements.

%C See A228461 and A217883 for more information about the definition.

%H R. H. Hardin, <a href="/A217878/b217878.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-4) -a(n-5) +a(n-6) +a(n-7).

%F Empirical g.f.: x*(1 + x^2 + x^3)*(3 + x^2 + x^3) / ((1 - x + x^2 + x^3)*(1 - 2*x - x^4)). - _Colin Barker_, Feb 23 2018

%e Some solutions for n=4:

%e ..0....1....0....0....2....1....1....1....0....1....2....0....0....0....1....0

%e ..0....1....2....0....1....1....2....2....1....1....2....1....1....0....2....1

%e ..0....2....0....0....1....1....0....2....2....0....2....1....1....2....1....2

%e ..2....2....0....1....1....1....0....1....1....0....1....1....2....2....1....0

%Y Column 3 of A217954. Also a column of A217883. Cf. A217954.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 14 2012