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 A274802 #4 Jul 07 2016 11:07:59 %S A274802 32,448,5888,85504,1252608,18476064,273764292,4044928780,59936952948, %T A274802 886462457880,13127736774888,194250101777432,2875817749885724, %U A274802 42561628448681904,630035159343912668,9325142535870239784 %N A274802 Number of nX7 0..2 arrays with no element equal to any value at offset (-1,-2) (-2,-1) (0,-1) or (-1,0) and new values introduced in order 0..2. %C A274802 Column 7 of A274803. %H A274802 R. H. Hardin, <a href="/A274802/b274802.txt">Table of n, a(n) for n = 1..210</a> %F A274802 Empirical: a(n) = 2*a(n-1) +182*a(n-2) +434*a(n-3) -4080*a(n-4) -11758*a(n-5) +15420*a(n-6) +64260*a(n-7) +38245*a(n-8) -87869*a(n-9) -225572*a(n-10) -13082*a(n-11) +255188*a(n-12) -3166*a(n-13) -19321*a(n-14) +49122*a(n-15) -82502*a(n-16) -88689*a(n-17) +115251*a(n-18) -9925*a(n-19) -4172*a(n-20) -937*a(n-21) -317*a(n-22) +140*a(n-23) -94*a(n-24) +6*a(n-25) for n>26 %e A274802 Some solutions for n=4 %e A274802 ..0..1..0..1..0..1..0. .0..1..0..1..2..1..0. .0..1..0..1..0..1..2 %e A274802 ..1..0..1..2..1..2..1. .1..2..1..0..1..2..1. .1..0..1..0..1..0..1 %e A274802 ..2..1..2..1..2..1..2. .2..1..2..1..2..1..2. .0..2..0..2..0..1..2 %e A274802 ..0..2..1..2..1..2..1. .1..2..0..2..1..0..1. .2..0..2..0..1..0..1 %Y A274802 Cf. A274803. %K A274802 nonn %O A274802 1,1 %A A274802 _R. H. Hardin_, Jul 07 2016