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 A284768 #6 Apr 05 2020 23:03:14 %S A284768 6,206,5637,145822,4219759,121021322,3595841703,107047691558, %T A284768 3230133817408,97858271141246,2984356113230844,91344755158599286, %U A284768 2807007399506811549,86507823542467916384,2673333189589167211891 %N A284768 Number of n X 5 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1. %C A284768 Column 5 of A284771. %H A284768 R. H. Hardin, <a href="/A284768/b284768.txt">Table of n, a(n) for n = 1..80</a> %e A284768 Some solutions for n=4 %e A284768 ..0..0..0..0..1. .0..1..1..0..0. .0..1..1..0..0. .0..1..0..1..0 %e A284768 ..1..0..1..1..1. .1..0..0..1..1. .0..0..1..1..0. .1..1..0..0..0 %e A284768 ..1..0..0..1..0. .0..0..0..1..1. .1..1..1..0..0. .1..0..0..1..0 %e A284768 ..0..1..0..1..0. .0..0..1..1..1. .0..0..1..0..0. .1..0..1..1..0 %Y A284768 Cf. A284771. %K A284768 nonn %O A284768 1,1 %A A284768 _R. H. Hardin_, Apr 02 2017