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 A209103 #7 Apr 17 2022 21:00:31 %S A209103 14,612,23248,849548,30836932,1118366188,40556341276,1470727552508, %T A209103 53334292149524,1934110124219172,70138417396144324, %U A209103 2543494195954824748,92237079873229771996,3344878451059254299004,121298417878736991992724 %N A209103 Number of 4 X n 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. %C A209103 Row 4 of A209100. %H A209103 R. H. Hardin, <a href="/A209103/b209103.txt">Table of n, a(n) for n = 1..210</a> %F A209103 Empirical: a(n) = 61*a(n-1) -1124*a(n-2) +9139*a(n-3) -34187*a(n-4) +44684*a(n-5) +35628*a(n-6) -128720*a(n-7) +102352*a(n-8) -44832*a(n-9) +17472*a(n-10) for n>12. %e A209103 Some solutions for n=4 %e A209103 ..0..0..0..0....0..0..0..0....0..0..1..2....0..1..2..1....0..1..2..1 %e A209103 ..1..1..1..2....1..1..1..0....2..1..0..0....2..0..0..0....2..0..1..2 %e A209103 ..2..0..1..0....2..2..0..1....1..2..1..0....0..2..2..0....0..2..0..2 %e A209103 ..1..2..0..2....0..1..0..0....2..1..2..2....0..1..0..1....0..1..2..1 %Y A209103 Cf. A209100. %K A209103 nonn %O A209103 1,1 %A A209103 _R. H. Hardin_, Mar 05 2012