This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A240193 #8 Oct 27 2018 06:22:12 %S A240193 3,12,37,129,478,1908,7868,32888,138292,583040,2461028,10393720, %T A240193 43907108,185502448,783769556,3311604104,13992449972,59122342816, %U A240193 249810507844,1055529401752,4459952527044,18844744947024,79625166220340 %N A240193 Number of 3 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4. %H A240193 R. H. Hardin, <a href="/A240193/b240193.txt">Table of n, a(n) for n = 1..210</a> %F A240193 Empirical: a(n) = 9*a(n-1) - 27*a(n-2) + 29*a(n-3) + 6*a(n-4) - 32*a(n-5) + 16*a(n-6) for n>9. %F A240193 Empirical g.f.: x*(3 - 15*x + 10*x^2 + 33*x^3 - 50*x^4 + 40*x^5 - 25*x^6 - 52*x^7 + 72*x^8) / ((1 - x)*(1 - 2*x)*(1 - 6*x + 7*x^2 + 4*x^3 - 8*x^4)). - _Colin Barker_, Oct 27 2018 %e A240193 Some solutions for n=4: %e A240193 ..2..0..0..0....2..0..0..0....2..0..0..0....2..0..0..0....2..0..0..0 %e A240193 ..1..3..2..0....2..3..2..0....1..2..0..0....1..2..2..0....1..0..0..2 %e A240193 ..1..3..2..3....2..3..2..0....1..2..2..0....1..2..1..3....2..3..0..0 %Y A240193 Row 3 of A240192. %K A240193 nonn %O A240193 1,1 %A A240193 _R. H. Hardin_, Apr 02 2014