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 A132446 #3 Nov 11 2010 07:34:06 %S A132446 1,2,3,4,10,24,71,322 %N A132446 The number of n x n crossword puzzles with at most one black square per row up to horizontal/vertical symmetry. %C A132446 Acceptable crossword puzzles must have all words of length 3 or more, at least one word in each row and each column and be connected. %H A132446 Marc Brodie, <a href="/A132446/a132446.txt">Mathematica program</a> %e A132446 a(5) = 3 because up to symmetry the only 5 x 5 acceptable crossword puzzles with at most one black square per row (using 1's for black squares and 0's for white) are: %e A132446 00000 10000 10000 %e A132446 00000 00000 10000 %e A132446 00000 00000 00000 %e A132446 00000 00000 00001 %e A132446 00000 00001 00001 %Y A132446 Cf. A130578, A132443, A132444, A132445. %K A132446 nonn %O A132446 3,2 %A A132446 Marc Brodie (mbrodie(AT)wju.edu), Aug 21 2007, Aug 22 2007