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 A269190 #4 Feb 20 2016 09:42:59 %S A269190 216,4476,115452,2817548,67134380,1567933676,36068275268,819789099172, %T A269190 18452018423420,411983259384452,9136178140885388,201433537180523700, %U A269190 4419013543755451812,96521322466937887324,2100165198065619059932 %N A269190 Number of nX4 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three no more than once. %C A269190 Column 4 of A269194. %H A269190 R. H. Hardin, <a href="/A269190/b269190.txt">Table of n, a(n) for n = 1..210</a> %F A269190 Empirical: a(n) = 46*a(n-1) -607*a(n-2) +1264*a(n-3) +11029*a(n-4) -27640*a(n-5) -86627*a(n-6) +153412*a(n-7) +308464*a(n-8) -329306*a(n-9) -438615*a(n-10) +260680*a(n-11) +134834*a(n-12) -65824*a(n-13) -9889*a(n-14) +5080*a(n-15) -400*a(n-16) for n>17 %e A269190 Some solutions for n=3 %e A269190 ..0..0..3..1. .3..3..3..3. .3..3..1..3. .0..0..0..0. .0..1..0..2 %e A269190 ..1..1..1..1. .3..1..3..1. .1..3..1..0. .1..0..0..0. .2..0..0..2 %e A269190 ..1..0..1..0. .1..3..1..3. .1..3..1..1. .2..0..1..1. .2..2..2..0 %Y A269190 Cf. A269194. %K A269190 nonn %O A269190 1,1 %A A269190 _R. H. Hardin_, Feb 20 2016