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 A302513 #4 Apr 09 2018 09:07:25 %S A302513 13,13,52,80,199,458,1088,2651,6257,14765,35292,84261,200040,475278, %T A302513 1132373,2696179,6411133,15251746,36304757,86394322,205538228, %U A302513 489069395,1163851093,2769397039,6589505584,15679835445,37311095302,88781699786 %N A302513 Number of nX6 0..1 arrays with every element equal to 0, 1, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302513 Column 6 of A302515. %H A302513 R. H. Hardin, <a href="/A302513/b302513.txt">Table of n, a(n) for n = 1..210</a> %F A302513 Empirical: a(n) = a(n-1) +6*a(n-3) +5*a(n-4) +3*a(n-5) -8*a(n-6) -6*a(n-7) -3*a(n-8) for n>12 %e A302513 Some solutions for n=5 %e A302513 ..0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..1..1. .0..1..0..1..0..1 %e A302513 ..0..1..1..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..1..1..0..1 %e A302513 ..0..0..0..1..0..1. .0..1..1..1..0..1. .0..1..0..1..0..1. .0..1..0..0..0..1 %e A302513 ..0..1..0..1..0..1. .0..1..0..0..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1 %e A302513 ..0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..0..0..1. .0..1..0..1..0..1 %Y A302513 Cf. A302515. %K A302513 nonn %O A302513 1,1 %A A302513 _R. H. Hardin_, Apr 09 2018