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 A275141 #8 Jan 31 2019 19:36:58 %S A275141 32,1296,2816,17872,107472,663904,4055152,24875600,152379136, %T A275141 933805200,5721947536,35062147296,214849132208,1316520434704, %U A275141 8067189289984,49432958970960,302908230284368,1856117667993184,11373652262370288 %N A275141 Number of n X 7 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,-2) or (0,-1) and new values introduced in order 0..2. %H A275141 R. H. Hardin, <a href="/A275141/b275141.txt">Table of n, a(n) for n = 1..210</a> %F A275141 Empirical: a(n) = 3*a(n-1) + 18*a(n-2) + 11*a(n-3) - 23*a(n-4) - 4*a(n-5) for n>7. %F A275141 Empirical g.f.: 16*x*(2 + 75*x - 103*x^2 - 891*x^3 - 647*x^4 + 1172*x^5 + 144*x^6) / (1 - 3*x - 18*x^2 - 11*x^3 + 23*x^4 + 4*x^5). - _Colin Barker_, Jan 31 2019 %e A275141 Some solutions for n=5: %e A275141 ..0..1..0..2..1..2..0. .0..1..2..0..1..2..0. .0..1..0..2..0..1..0 %e A275141 ..0..2..1..0..2..1..2. .2..0..1..2..0..1..0. .0..2..1..0..1..0..1 %e A275141 ..1..2..1..0..2..1..0. .2..0..1..2..0..1..2. .1..0..1..0..2..1..2 %e A275141 ..1..0..2..1..2..1..0. .1..0..1..2..0..1..2. .2..0..2..1..2..1..0 %e A275141 ..2..1..2..1..0..2..1. .0..1..0..1..0..1..2. .0..1..0..2..0..2..1 %Y A275141 Column 7 of A275142. %K A275141 nonn %O A275141 1,1 %A A275141 _R. H. Hardin_, Jul 17 2016