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 #7 Apr 19 2021 17:04:56
%S 596653,1747075,5273797,17048731,67476109,275808307,1180360357,
%T 5652251635,27729452461,140207992699,758880838813,4181652023251,
%U 23526377578933,138205654308355,822362988368317,4963895328442891
%N Number of (n+2) X 6 0..2 arrays with each 3 X 3 subblock having a sum of 9.
%C Column 4 of A187645.
%H R. H. Hardin, <a href="/A187643/b187643.txt">Table of n, a(n) for n = 1..23</a>
%e Some solutions for 4 X 6
%e ..0..1..1..0..0..2....0..2..0..0..2..0....0..1..2..0..0..2....0..2..1..1..2..0
%e ..0..1..1..1..2..2....0..1..1..2..2..2....0..0..1..1..2..1....0..1..2..0..1..2
%e ..2..1..2..1..1..0....2..1..2..0..0..1....2..1..2..1..0..2....1..2..0..0..2..1
%e ..0..1..1..0..0..2....1..0..1..1..0..1....2..1..0..2..0..0....1..0..2..2..0..1
%Y Cf. A187645.
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 12 2011