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 A269015 #4 Feb 17 2016 12:07:43 %S A269015 0,145,1066,14240,109058,1049588,8134304,69184207,534525058, %T A269015 4286305792,32838001316,255036784680,1935580387968,14746081110093, %U A269015 110945210978202,834598743197152,6232287294972630,46465158121063708,344786403529703264 %N A269015 Number of 5Xn binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once. %C A269015 Row 5 of A269011. %H A269015 R. H. Hardin, <a href="/A269015/b269015.txt">Table of n, a(n) for n = 1..210</a> %F A269015 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 A269015 Some solutions for n=4 %e A269015 ..0..0..0..0. .0..0..0..1. .1..0..0..1. .1..0..0..0. .1..0..1..0 %e A269015 ..0..1..0..0. .0..0..0..1. .1..0..0..1. .0..1..0..0. .1..0..1..0 %e A269015 ..0..0..0..0. .0..1..0..0. .0..1..0..0. .0..0..0..1. .1..0..0..1 %e A269015 ..1..1..0..1. .1..0..0..0. .0..1..0..0. .0..0..0..0. .0..0..0..0 %e A269015 ..0..0..0..1. .0..0..0..0. .0..0..0..1. .0..0..0..1. .0..0..0..1 %Y A269015 Cf. A269011. %K A269015 nonn %O A269015 1,2 %A A269015 _R. H. Hardin_, Feb 17 2016