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 A269079 #4 Feb 19 2016 08:48:07 %S A269079 32,244,2343,20400,165607,1383105,10778640,86308622,661641931, %T A269079 5146079168,39031235709,297777942033,2239241624640,16861326990168, %U A269079 125878250277823,939067269600080,6967653661432115,51619835791134129,381021973991495280 %N A269079 Number of 5Xn binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. %C A269079 Row 5 of A269075. %H A269079 R. H. Hardin, <a href="/A269079/b269079.txt">Table of n, a(n) for n = 1..210</a> %F A269079 Empirical: a(n) = 8*a(n-1) +52*a(n-2) -424*a(n-3) -816*a(n-4) +6756*a(n-5) +1362*a(n-6) -38476*a(n-7) +19016*a(n-8) +82920*a(n-9) -70008*a(n-10) -50556*a(n-11) +50607*a(n-12) +9180*a(n-13) -10404*a(n-14) %e A269079 Some solutions for n=4 %e A269079 ..0..0..0..0. .1..0..1..0. .0..0..0..1. .0..0..0..1. .0..0..0..1 %e A269079 ..0..0..0..1. .0..0..1..0. .1..0..0..0. .0..1..0..1. .0..0..1..0 %e A269079 ..0..1..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..1. .0..0..0..0 %e A269079 ..0..1..0..0. .0..0..0..0. .1..0..0..0. .0..1..0..1. .0..0..0..0 %e A269079 ..0..0..0..1. .0..1..1..0. .1..0..1..0. .0..1..0..1. .1..0..1..0 %Y A269079 Cf. A269075. %K A269079 nonn %O A269079 1,1 %A A269079 _R. H. Hardin_, Feb 19 2016