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 A299594 #8 Feb 15 2018 15:24:05 %S A299594 21,26,65,250,541,1225,2583,5488,11899,25570,54750,117697,252985, %T A299594 543115,1166472,2505919,5382274,11560042,24830445,53333641,114554095, %U A299594 246050920,528494067,1135150426,2438187262,5236983073,11248510665,24160660963 %N A299594 Number of n X 7 0..1 arrays with every element unequal to 0, 1 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. %C A299594 Column 7 of A299595. %H A299594 R. H. Hardin, <a href="/A299594/b299594.txt">Table of n, a(n) for n = 1..210</a> %F A299594 Empirical: a(n) = a(n-1) +a(n-2) +3*a(n-3) +a(n-4) -a(n-5) -a(n-6) for n>9. %F A299594 Empirical g.f.: x*(21 + 5*x + 18*x^2 + 96*x^3 + 127*x^4 + 234*x^5 + 49*x^6 - 102*x^7 - 73*x^8) / ((1 + x^2 - x^3)*(1 - x - 2*x^2 - x^3)). - _Colin Barker_, Feb 15 2018 %e A299594 Some solutions for n=5: %e A299594 ..0..0..0..1..0..0..0. .0..0..0..0..0..0..0. .0..0..0..0..1..0..0 %e A299594 ..0..0..0..0..0..0..0. .0..0..0..0..0..0..0. .0..0..0..0..0..0..0 %e A299594 ..0..0..0..0..0..0..0. .0..0..0..0..0..0..0. .1..0..0..0..0..0..1 %e A299594 ..1..0..0..0..0..0..0. .0..0..0..0..0..0..0. .0..0..0..0..0..0..0 %e A299594 ..0..0..0..0..0..1..0. .0..0..0..0..1..0..0. .0..0..0..0..0..0..0 %Y A299594 Cf. A299595. %K A299594 nonn %O A299594 1,1 %A A299594 _R. H. Hardin_, Feb 13 2018