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 A269105 #4 Feb 19 2016 13:44:23 %S A269105 216,15540,872460,43964700,2085484068,95166487524,4227147007836, %T A269105 184069947098892,7894012975085748,334480929126425748, %U A269105 14034341507370527532,584107408947764887164,24145251769444080595908 %N A269105 Number of nX4 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. %C A269105 Column 4 of A269109. %H A269105 R. H. Hardin, <a href="/A269105/b269105.txt">Table of n, a(n) for n = 1..210</a> %F A269105 Empirical: a(n) = 90*a(n-1) -2559*a(n-2) +24556*a(n-3) -94959*a(n-4) +140442*a(n-5) -69169*a(n-6) for n>7 %e A269105 Some solutions for n=2 %e A269105 ..3..2..0..2. .3..1..1..0. .2..3..1..3. .3..0..0..2. .0..0..2..3 %e A269105 ..2..0..0..1. .2..0..3..1. .2..2..3..3. .3..1..0..0. .0..0..3..1 %Y A269105 Cf. A269109. %K A269105 nonn %O A269105 1,1 %A A269105 _R. H. Hardin_, Feb 19 2016