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 A275501 #4 Jul 30 2016 19:56:08 %S A275501 41,1944,2000,3168,4180,13384,43780,143784,470352,1549756,5114352, %T A275501 16851668,55718276,183999596,607959912,2009783684,6640967048, %U A275501 21951863104,72556631720,239811612380,792682822452,2620034132264,8660100023060 %N A275501 Number of nX5 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2. %C A275501 Column 5 of A275504. %H A275501 R. H. Hardin, <a href="/A275501/b275501.txt">Table of n, a(n) for n = 1..210</a> %F A275501 Empirical: a(n) = a(n-1) +16*a(n-2) -120*a(n-4) -55*a(n-5) +549*a(n-6) +319*a(n-7) -1772*a(n-8) -891*a(n-9) +4300*a(n-10) +1407*a(n-11) -7992*a(n-12) -1155*a(n-13) +11470*a(n-14) +a(n-15) -12854*a(n-16) +1155*a(n-17) +11372*a(n-18) -1407*a(n-19) -7960*a(n-20) +891*a(n-21) +4357*a(n-22) -320*a(n-23) -1820*a(n-24) +55*a(n-25) +560*a(n-26) -120*a(n-28) -a(n-29) +16*a(n-30) -a(n-32) for n>36 %e A275501 Some solutions for n=4 %e A275501 ..0..1..2..1..1. .0..0..0..0..1. .0..0..0..0..0. .0..0..0..1..0 %e A275501 ..1..2..2..0..0. .2..1..1..1..2. .1..1..1..1..1. .0..1..1..1..2 %e A275501 ..1..2..0..0..2. .1..1..2..2..2. .2..2..2..2..2. .1..2..2..2..2 %e A275501 ..0..0..0..1..1. .1..0..0..0..0. .0..0..0..0..0. .1..2..0..0..0 %Y A275501 Cf. A275504. %K A275501 nonn %O A275501 1,1 %A A275501 _R. H. Hardin_, Jul 30 2016