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 A299739 #4 Feb 18 2018 10:15:12 %S A299739 64,8192,582032,49914496,4203272237,356575568843,30260326859957, %T A299739 2568233775595684,217979679558156226,18501304542474481340, %U A299739 1570323059564422761030,133283374981849052162973 %N A299739 Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. %C A299739 Column 7 of A299740. %H A299739 R. H. Hardin, <a href="/A299739/b299739.txt">Table of n, a(n) for n = 1..210</a> %e A299739 Some solutions for n=5 %e A299739 ..0..0..0..1..1..0..0. .0..0..0..1..0..1..0. .0..0..0..1..0..1..1 %e A299739 ..0..1..1..0..1..0..0. .0..0..0..1..0..0..1. .0..1..1..0..0..1..0 %e A299739 ..0..0..0..0..1..0..0. .0..0..0..1..1..0..1. .0..0..0..0..1..1..0 %e A299739 ..0..0..1..0..0..0..1. .0..0..0..1..0..0..0. .0..0..1..0..1..1..1 %e A299739 ..0..1..1..1..1..0..0. .0..0..0..1..0..1..1. .0..1..1..1..0..0..1 %Y A299739 Cf. A299740. %K A299739 nonn %O A299739 1,1 %A A299739 _R. H. Hardin_, Feb 18 2018