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 A274746 #7 Jan 30 2019 11:17:09 %S A274746 8,60,518,4554,40242,355504,3140840,27748676,245154340,2165891856, %T A274746 19135242632,169056228008,1493579612136,13195491722256, %U A274746 116579658950800,1029959107782112,9099492769592768,80392287459022000,710250565228311920 %N A274746 Number of n X 5 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 A274746 R. H. Hardin, <a href="/A274746/b274746.txt">Table of n, a(n) for n = 1..210</a> %F A274746 Empirical: a(n) = 9*a(n-1) - 14*a(n-3) + 10*a(n-4) - 2*a(n-5) for n>6. %F A274746 Empirical g.f.: 2*x*(4 - 6*x - 11*x^2 + 2*x^3 + 8*x^4 - 3*x^5) / (1 - 9*x + 14*x^3 - 10*x^4 + 2*x^5). - _Colin Barker_, Jan 30 2019 %e A274746 Some solutions for n=4: %e A274746 ..0..1..0..2..0. .0..1..0..1..2. .0..1..0..2..1. .0..1..2..1..2 %e A274746 ..2..0..1..0..2. .2..0..2..0..1. .1..0..2..0..2. .1..2..1..0..1 %e A274746 ..0..2..0..1..0. .0..2..0..1..0. .0..1..0..2..1. .2..1..2..1..0 %e A274746 ..1..0..1..0..2. .2..1..2..0..1. .1..0..2..0..2. .1..0..1..0..1 %Y A274746 Column 5 of A274749. %K A274746 nonn %O A274746 1,1 %A A274746 _R. H. Hardin_, Jul 04 2016