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 A275128 #4 Jul 17 2016 10:58:42 %S A275128 41,256,675,2545,12423,62378,315021,1591442,8024937,40445177, %T A275128 203778488,1026594464,5172646773,26068048495,131374129725, %U A275128 662045442417,3336258461916,16812605674569,84724677500065,426956397683686 %N A275128 Number of nX5 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. %C A275128 Column 5 of A275131. %H A275128 R. H. Hardin, <a href="/A275128/b275128.txt">Table of n, a(n) for n = 1..210</a> %F A275128 Empirical: a(n) = 8*a(n-1) -27*a(n-2) +79*a(n-3) -99*a(n-4) -81*a(n-5) +860*a(n-6) -1162*a(n-7) -868*a(n-8) +1676*a(n-9) -3352*a(n-10) -1549*a(n-11) +4857*a(n-12) +1164*a(n-13) +3213*a(n-14) +5946*a(n-15) -1377*a(n-16) -5652*a(n-17) -4880*a(n-18) -2760*a(n-19) -710*a(n-20) +595*a(n-21) +1142*a(n-22) +594*a(n-23) +71*a(n-24) +48*a(n-25) +20*a(n-26) +a(n-28) for n>31 %e A275128 Some solutions for n=4 %e A275128 ..0..1..0..2..1. .0..1..1..2..2. .0..0..1..1..2. .0..0..0..1..1 %e A275128 ..2..2..1..0..0. .2..0..0..1..1. .2..2..0..0..0. .1..1..2..2..0 %e A275128 ..0..0..2..2..2. .1..2..2..0..0. .0..1..1..2..2. .0..0..1..1..2 %e A275128 ..2..1..1..1..0. .0..1..1..2..2. .2..0..0..1..1. .2..2..0..0..1 %Y A275128 Cf. A275131. %K A275128 nonn %O A275128 1,1 %A A275128 _R. H. Hardin_, Jul 17 2016