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 A268892 #4 Feb 15 2016 11:38:51 %S A268892 0,2285,60666,1706732,39670270,911930096,19876401224,426591159751, %T A268892 8952723005030,185650834624156,3802871585155968,77225962585267472, %U A268892 1555913690406127580,31149964203775581289,620153220846869863058 %N A268892 Number of 7Xn binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once. %C A268892 Row 7 of A268886. %H A268892 R. H. Hardin, <a href="/A268892/b268892.txt">Table of n, a(n) for n = 1..210</a> %H A268892 R. H. Hardin, <a href="/A268892/a268892.txt">Empirical recurrence of order 68</a> %F A268892 Empirical recurrence of order 68 (see link above) %e A268892 Some solutions for n=3 %e A268892 ..1..0..0. .0..1..1. .1..0..0. .0..0..1. .0..1..0. .0..0..0. .0..0..1 %e A268892 ..0..0..1. .0..0..0. .1..1..0. .1..0..0. .0..1..0. .0..0..1. .1..0..0 %e A268892 ..1..0..0. .1..0..1. .0..0..1. .0..0..0. .1..0..1. .1..0..1. .1..0..0 %e A268892 ..1..0..0. .1..0..1. .1..0..0. .0..0..0. .1..0..0. .0..0..1. .0..1..0 %e A268892 ..0..1..0. .0..0..0. .1..0..1. .0..1..1. .1..0..0. .0..1..0. .0..1..0 %e A268892 ..1..0..0. .1..0..1. .0..0..1. .0..0..0. .1..0..1. .0..1..0. .1..0..1 %e A268892 ..1..0..0. .0..0..1. .0..0..0. .0..1..0. .0..0..0. .0..0..1. .0..0..0 %Y A268892 Cf. A268886. %K A268892 nonn %O A268892 1,2 %A A268892 _R. H. Hardin_, Feb 15 2016