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 A299660 #4 Feb 15 2018 14:48:23 %S A299660 64,8192,624007,53909088,4634931975,400012077773,34546300829517, %T A299660 2983786339120760,257723568617382229,22261041202423804183, %U A299660 1922815213079467303536,166084822425643801285901 %N A299660 Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. %C A299660 Column 7 of A299661. %H A299660 R. H. Hardin, <a href="/A299660/b299660.txt">Table of n, a(n) for n = 1..210</a> %e A299660 Some solutions for n=5 %e A299660 ..0..0..0..0..1..0..1. .0..0..0..0..1..1..1. .0..0..0..1..1..0..1 %e A299660 ..0..0..1..1..1..0..0. .0..0..1..0..1..0..1. .0..0..1..1..0..1..0 %e A299660 ..0..0..0..1..0..1..0. .0..0..0..0..1..0..0. .0..0..0..1..1..1..0 %e A299660 ..0..0..0..0..1..0..1. .0..0..0..0..1..1..0. .0..0..0..0..0..1..1 %e A299660 ..0..0..1..1..1..0..1. .0..0..1..0..0..1..1. .0..0..1..1..0..0..1 %Y A299660 Cf. A299661. %K A299660 nonn %O A299660 1,1 %A A299660 _R. H. Hardin_, Feb 15 2018