login

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”).

Number of (n+1)X(3+1) 0..3 arrays colored with the sets of distinct values in every 2X2 subblock, with new values 0..3 introduced row-major order
1

%I #4 Jan 21 2014 09:11:02

%S 1571,112194,8080990,582449912,41971475967,3024814165927,

%T 217984456560858,15709348690960801,1132110934012682002,

%U 81586888372019842248,5879651366601790499887,423723778002503372979545

%N Number of (n+1)X(3+1) 0..3 arrays colored with the sets of distinct values in every 2X2 subblock, with new values 0..3 introduced row-major order

%C Column 3 of A236262

%H R. H. Hardin, <a href="/A236261/b236261.txt">Table of n, a(n) for n = 1..95</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 21 2014