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 A274751 #8 Jan 30 2019 15:26:53 %S A274751 4,27,144,813,4554,25585,143634,806695,4529786,25438375,142850048, %T A274751 802197187,4504820208,25297392889,142060454416,797757713921, %U A274751 4479903521254,25157436233205,141274594599246,793344420605515 %N A274751 Number of 4 X n 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2. %H A274751 R. H. Hardin, <a href="/A274751/b274751.txt">Table of n, a(n) for n = 1..210</a> %F A274751 Empirical: a(n) = 2*a(n-1) + 20*a(n-2) + 10*a(n-3) - 44*a(n-4) - 20*a(n-5) + 31*a(n-6) + 2*a(n-7) - 4*a(n-8). %F A274751 Empirical g.f.: x*(4 + 19*x + 10*x^2 - 55*x^3 - 46*x^4 + 45*x^5 + 6*x^6 - 6*x^7) / ((1 + x - x^2)*(1 - 3*x - 16*x^2 + 3*x^3 + 25*x^4 - 2*x^5 - 4*x^6)). - _Colin Barker_, Jan 30 2019 %e A274751 Some solutions for n=4: %e A274751 ..0..1..0..1. .0..1..0..2. .0..1..0..1. .0..1..0..2. .0..1..0..1 %e A274751 ..2..0..1..0. .1..2..1..0. .2..0..1..0. .1..0..2..0. .1..2..1..2 %e A274751 ..0..2..0..1. .0..1..2..1. .0..1..0..1. .0..1..0..1. .2..0..2..1 %e A274751 ..2..1..2..0. .1..0..1..0. .1..2..1..0. .2..0..2..0. .0..1..0..2 %Y A274751 Row 4 of A274749. %K A274751 nonn %O A274751 1,1 %A A274751 _R. H. Hardin_, Jul 04 2016