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 A275562 #4 Aug 01 2016 21:25:53 %S A275562 12,288,672,3192,13104,57600,248520,1075140,4663710,20186982,87477240, %T A275562 378971730,1641701760,7112729712,30813640998,133494984432, %U A275562 578341554336,2505543992028,10854800690652,47026263554508,203732097403680 %N A275562 Number of nX5 0..2 arrays with no element equal to any value at offset (-2,0) (-1,2) or (0,-2) and new values introduced in order 0..2. %C A275562 Column 5 of A275565. %H A275562 R. H. Hardin, <a href="/A275562/b275562.txt">Table of n, a(n) for n = 1..210</a> %F A275562 Empirical: a(n) = a(n-1) +22*a(n-2) +8*a(n-3) -191*a(n-4) -156*a(n-5) +917*a(n-6) +837*a(n-7) -2936*a(n-8) -2248*a(n-9) +6832*a(n-10) +3015*a(n-11) -11514*a(n-12) -1236*a(n-13) +14699*a(n-14) -2370*a(n-15) -15138*a(n-16) +4822*a(n-17) +12804*a(n-18) -4364*a(n-19) -8775*a(n-20) +2339*a(n-21) +4703*a(n-22) -715*a(n-23) -1892*a(n-24) +91*a(n-25) +563*a(n-26) +8*a(n-27) -120*a(n-28) -3*a(n-29) +16*a(n-30) -a(n-32) for n>34 %e A275562 Some solutions for n=4 %e A275562 ..0..1..1..2..0. .0..0..1..2..0. .0..0..1..1..2. .0..1..2..0..1 %e A275562 ..0..1..2..0..1. .0..1..1..0..2. .2..2..1..0..2. .1..2..0..1..2 %e A275562 ..1..2..2..1..1. .2..2..0..0..1. .2..1..0..2..1. .2..0..1..1..2 %e A275562 ..1..0..0..2..2. .1..2..0..1..1. .1..1..2..2..1. .2..0..1..2..0 %Y A275562 Cf. A275565. %K A275562 nonn %O A275562 1,1 %A A275562 _R. H. Hardin_, Aug 01 2016