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 A302007 #4 Mar 30 2018 12:50:52 %S A302007 16,512,13616,369040,9989376,270422672,7320574992,198174358400, %T A302007 5364752820144,145228540660944,3931463336250816,106428143490485072, %U A302007 2881102723859806480,77993965065966629248,2111364699472345059888 %N A302007 Number of nX5 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A302007 Column 5 of A302010. %H A302007 R. H. Hardin, <a href="/A302007/b302007.txt">Table of n, a(n) for n = 1..210</a> %F A302007 Empirical: a(n) = 24*a(n-1) +82*a(n-2) +34*a(n-3) -90*a(n-4) -40*a(n-5) +37*a(n-6) %e A302007 Some solutions for n=5 %e A302007 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0 %e A302007 ..0..0..1..0..1. .0..0..1..1..0. .0..0..1..0..0. .0..0..1..1..0 %e A302007 ..1..1..1..0..1. .1..0..1..0..1. .0..1..1..0..1. .0..1..0..1..1 %e A302007 ..0..1..0..0..1. .1..0..1..1..1. .1..1..1..0..0. .1..1..0..0..0 %e A302007 ..0..0..0..0..1. .0..1..0..0..0. .0..1..0..0..0. .0..1..0..1..0 %Y A302007 Cf. A302010. %K A302007 nonn %O A302007 1,1 %A A302007 _R. H. Hardin_, Mar 30 2018