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 A285751 #6 Apr 05 2020 23:20:48 %S A285751 0,4,8,44,150,540,2042,7760,29654,114336,442152,1713832,6655764, %T A285751 25893236,100873154,393455752,1536357188,6005069488,23492496948, %U A285751 91979426392,360391230046,1413045432264,5543910852492,21763924972776,85487754197390 %N A285751 Number of 2 X n 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1. %C A285751 Row 2 of A285750. %H A285751 R. H. Hardin, <a href="/A285751/b285751.txt">Table of n, a(n) for n = 1..210</a> %e A285751 Some solutions for n=4 %e A285751 ..0..0..0..1. .1..1..0..0. .0..1..0..0. .0..0..0..0. .1..1..0..0 %e A285751 ..0..0..0..0. .0..1..1..0. .1..1..0..0. .0..0..0..1. .0..1..0..0 %Y A285751 Cf. A285750. %K A285751 nonn %O A285751 1,2 %A A285751 _R. H. Hardin_, Apr 25 2017