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 A269182 #4 Feb 20 2016 09:11:56 %S A269182 108,2736,80112,2097552,52394312,1265974992,29881402560,693021071760, %T A269182 15854541802056,358760880894864,8045649521280080,179088561311942528, %U A269182 3961164069598726264,87139967884594089296,1907940856141713336608 %N A269182 Number of nX4 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three exactly once. %C A269182 Column 4 of A269186. %H A269182 R. H. Hardin, <a href="/A269182/b269182.txt">Table of n, a(n) for n = 1..210</a> %F A269182 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 A269182 Some solutions for n=3 %e A269182 ..0..2..2..2. .0..2..0..2. .1..1..3..3. .2..3..3..2. .2..0..1..0 %e A269182 ..3..2..2..2. .2..2..0..2. .1..3..3..1. .2..2..2..3. .0..1..0..0 %e A269182 ..3..3..2..0. .0..0..0..1. .2..3..1..3. .3..2..0..2. .0..0..0..0 %Y A269182 Cf. A269186. %K A269182 nonn %O A269182 1,1 %A A269182 _R. H. Hardin_, Feb 20 2016