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 A274892 #6 Apr 21 2021 12:53:43 %S A274892 8,108,86,290,913,3017,9863,32539,107369,354366,1171235,3869271, %T A274892 12787884,42266197,139689475,461723614,1526118256,5044271535, %U A274892 16673106905,55109948877,182157291955,602093030588,1990121537282,6578044463591 %N A274892 Number of n X 5 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2. %C A274892 Column 5 of A274895. %H A274892 R. H. Hardin, <a href="/A274892/b274892.txt">Table of n, a(n) for n = 1..210</a> %F A274892 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>34. %e A274892 Some solutions for n=4 %e A274892 ..0..1..2..1..2. .0..1..2..0..2. .0..1..0..2..1. .0..1..0..1..2 %e A274892 ..0..1..0..1..2. .0..2..0..1..2. .2..1..2..1..0. .1..2..0..2..0 %e A274892 ..1..2..0..2..0. .1..2..1..2..0. .2..0..2..1..2. .1..0..1..2..0 %e A274892 ..2..0..1..2..0. .2..0..1..2..0. .1..0..1..0..2. .2..0..2..0..1 %Y A274892 Cf. A274895. %K A274892 nonn %O A274892 1,1 %A A274892 _R. H. Hardin_, Jul 10 2016