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 A269191 #4 Feb 20 2016 09:43:45 %S A269191 756,27684,1399612,67134380,3159954052,145995171708,6648192704604, %T A269191 299224791093196,13339889117822420,590022908205332548, %U A269191 25923065488446232140,1132469284935764232244,49229470523358865713156 %N A269191 Number of nX5 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three no more than once. %C A269191 Column 5 of A269194. %H A269191 R. H. Hardin, <a href="/A269191/b269191.txt">Table of n, a(n) for n = 1..210</a> %F A269191 Empirical: a(n) = 118*a(n-1) -5041*a(n-2) +93278*a(n-3) -616456*a(n-4) -3048560*a(n-5) +60109885*a(n-6) -129687930*a(n-7) -1739169369*a(n-8) +8259890048*a(n-9) +20240706091*a(n-10) -173579758748*a(n-11) -34263378926*a(n-12) +1854959811756*a(n-13) -1352133363698*a(n-14) -11158815731728*a(n-15) +13195242387667*a(n-16) +40081045519402*a(n-17) -56960114535700*a(n-18) -88448187207398*a(n-19) +137934077935370*a(n-20) +119462198991804*a(n-21) -202996386004581*a(n-22) -94913498792266*a(n-23) +187975033925075*a(n-24) +38342927037264*a(n-25) -110576189373568*a(n-26) -1510870946200*a(n-27) +40619114535308*a(n-28) -5466962964240*a(n-29) -8777770697408*a(n-30) +2325318442944*a(n-31) +946747193728*a(n-32) -404404766528*a(n-33) -21593127872*a(n-34) +28030228480*a(n-35) -2948913408*a(n-36) -308060672*a(n-37) +51977984*a(n-38) +752640*a(n-39) -230400*a(n-40) for n>41 %e A269191 Some solutions for n=2 %e A269191 ..1..0..2..0..0. .1..1..0..0..1. .0..0..1..3..3. .1..1..2..2..3 %e A269191 ..0..0..2..0..2. .0..1..1..1..1. .2..0..1..3..2. .1..0..0..2..3 %Y A269191 Cf. A269194. %K A269191 nonn %O A269191 1,1 %A A269191 _R. H. Hardin_, Feb 20 2016