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 A293101 #6 Apr 05 2020 23:48:59 %S A293101 0,0,9,42,150,596,2220,8376,31959,121768,465365,1784742,6865278, %T A293101 26474028,102325886,396332796,1538015240,5978805044,23278677150, %U A293101 90767915948,354389747119,1385333740384,5421345875519,21237273165782,83270840712919 %N A293101 Number of 2 X n 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 two less than the number of 0's adjacent to some 1. %C A293101 Row 2 of A293100. %H A293101 R. H. Hardin, <a href="/A293101/b293101.txt">Table of n, a(n) for n = 1..210</a> %e A293101 Some solutions for n=4 %e A293101 ..0..1..0..0. .0..1..1..0. .0..0..1..0. .0..0..1..1. .1..1..1..0 %e A293101 ..0..0..0..1. .0..0..1..0. .0..0..1..0. .0..0..0..0. .0..0..0..0 %Y A293101 Cf. A293100. %K A293101 nonn %O A293101 1,3 %A A293101 _R. H. Hardin_, Sep 30 2017