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 A268883 #4 Feb 15 2016 11:31:39 %S A268883 10,158,2190,27130,317966,3596174,39670270,429588382,4585939726, %T A268883 48401059362,506108414670,5251396681678,54134020936742, %U A268883 554930619106590,5661171443312270,57509255942550986,582036972222995470 %N A268883 Number of nX5 binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once. %C A268883 Column 5 of A268886. %H A268883 R. H. Hardin, <a href="/A268883/b268883.txt">Table of n, a(n) for n = 1..210</a> %F A268883 Empirical: a(n) = 26*a(n-1) -241*a(n-2) +994*a(n-3) -2060*a(n-4) +2218*a(n-5) -1201*a(n-6) +290*a(n-7) -25*a(n-8) for n>9 %e A268883 Some solutions for n=4 %e A268883 ..1..0..0..0..0. .1..0..0..0..1. .0..0..1..0..0. .0..1..0..1..0 %e A268883 ..1..0..0..1..0. .0..0..0..1..0. .1..0..0..1..0. .0..1..0..0..0 %e A268883 ..1..1..0..0..0. .0..1..0..0..0. .1..0..1..0..1. .0..0..0..1..0 %e A268883 ..0..0..1..0..1. .0..0..1..0..0. .1..0..0..0..1. .0..0..0..1..1 %Y A268883 Cf. A268886. %K A268883 nonn %O A268883 1,1 %A A268883 _R. H. Hardin_, Feb 15 2016