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 A299659 #4 Feb 15 2018 14:47:44 %S A299659 32,2048,86123,4001253,185302633,8607101770,400012077773, %T A299659 18591844096646,864147943636240,40165914492008178,1866929265130170249, %U A299659 86775739876609282395,4033377275756444263520,187473281454195133866240 %N A299659 Number of nX6 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 A299659 Column 6 of A299661. %H A299659 R. H. Hardin, <a href="/A299659/b299659.txt">Table of n, a(n) for n = 1..210</a> %e A299659 Some solutions for n=5 %e A299659 ..0..0..0..1..1..0. .0..1..1..1..0..1. .0..0..0..1..0..1. .0..0..1..0..1..0 %e A299659 ..0..1..0..1..0..1. .0..0..1..0..0..1. .0..1..0..1..1..0. .0..1..0..0..1..0 %e A299659 ..0..0..0..1..0..0. .0..0..0..1..0..1. .0..0..0..1..0..0. .0..0..0..1..0..1 %e A299659 ..0..0..0..1..0..0. .0..0..0..1..1..0. .0..0..0..1..0..1. .0..0..0..1..0..1 %e A299659 ..0..0..1..1..1..0. .0..1..0..0..1..1. .0..0..1..0..0..1. .0..0..1..1..0..1 %Y A299659 Cf. A299661. %K A299659 nonn %O A299659 1,1 %A A299659 _R. H. Hardin_, Feb 15 2018