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 A275132 #8 Jan 31 2019 19:36:30 %S A275132 2,12,45,174,675,2607,10077,38967,150651,582435,2251827,8706015, %T A275132 33659139,130132935,503119779,1945160703,7520376939,29075268471, %U A275132 112410752211,434602254687,1680258482619,6496212425799,25115645192451,97102063806447 %N A275132 Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2. %H A275132 R. H. Hardin, <a href="/A275132/b275132.txt">Table of n, a(n) for n = 1..210</a> %F A275132 Empirical: a(n) = 3*a(n-1) + 2*a(n-2) + 6*a(n-3) - 2*a(n-4) - 4*a(n-5) for n>6. %F A275132 Empirical g.f.: x*(2 + 6*x + 5*x^2 + 3*x^3 - 5*x^4 - 4*x^5) / ((1 + x + 2*x^2)*(1 - 4*x + 2*x^3)). - _Colin Barker_, Jan 31 2019 %e A275132 Some solutions for n=4: %e A275132 ..0..1..1..2. .0..0..0..1. .0..1..0..1. .0..1..1..1. .0..1..1..1 %e A275132 ..2..2..0..0. .1..1..2..0. .2..2..2..2. .2..2..0..0. .2..2..0..0 %e A275132 ..1..1..1..2. .0..0..1..1. .0..1..1..0. .0..1..2..2. .0..1..1..2 %Y A275132 Row 3 of A275131. %K A275132 nonn %O A275132 1,1 %A A275132 _R. H. Hardin_, Jul 17 2016