Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 31 2012 12:36:35
%S 1,15,280,5295,101460,1999365,40210161,820951127,16962540224,
%T 353916457700,7444303111792,157654572063308,3358267477535756,
%U 71896125048485001,1545960357028561441,33370692254737883179
%N Number of nX3 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to two or fewer horizontal or vertical neighbors
%C Column 3 of A199101
%H R. H. Hardin, <a href="/A199096/b199096.txt">Table of n, a(n) for n = 1..56</a>
%e Some solutions for n=4
%e ..0..1..0....0..1..1....0..1..2....0..1..2....0..1..0....0..1..0....0..1..1
%e ..2..0..2....2..0..2....2..2..0....1..0..2....2..1..0....1..0..1....1..0..0
%e ..1..0..1....1..2..2....1..0..2....2..0..2....2..0..1....2..2..1....2..2..2
%e ..2..2..1....1..0..0....1..0..1....1..0..1....2..2..1....2..2..0....2..0..1
%K nonn
%O 1,2
%A _R. H. Hardin_ Nov 02 2011