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 Oct 26 2018 08:59:07
%S 5,23,105,478,2165,9811,44399,201006,909679,4117547,18635613,84347726,
%T 381758761,1727876419,7820451787,35395951502,160204196803,
%U 725095175067,3281826924665,14853766696750,67229111585533,304283379907315
%N Number of 2 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.
%H R. H. Hardin, <a href="/A239406/b239406.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) + 12*a(n-2) - 18*a(n-3) - 29*a(n-4) + 19*a(n-5) + 38*a(n-6) + 8*a(n-7).
%F Empirical g.f.: x*(5 + 8*x - 24*x^2 - 23*x^3 + 30*x^4 + 42*x^5 + 8*x^6) / (1 - 3*x - 12*x^2 + 18*x^3 + 29*x^4 - 19*x^5 - 38*x^6 - 8*x^7). - _Colin Barker_, Oct 26 2018
%e Some solutions for n=5:
%e ..3..3..1..3..0....3..1..0..0..3....0..0..3..1..3....3..3..0..0..0
%e ..0..2..0..0..0....2..0..1..1..3....3..3..2..2..2....2..0..0..1..3
%Y Row 2 of A239405.
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 17 2014