login

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

Number of nX5 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors
1

%I #5 Mar 31 2012 12:35:52

%S 15,1325,46841,1728533,63868351,2359134621,87176303417,3221377019429,

%T 119037100116183,4398697422258081,162542044954494221,

%U 6006305685720331925,221946939432242106215,8201454756620862955585,303062796878789833114397

%N Number of nX5 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors

%C Column 5 of A183554

%H R. H. Hardin, <a href="/A183550/b183550.txt">Table of n, a(n) for n = 1..200</a>

%e Some solutions for 3X5

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 2011