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 A100664 #19 Oct 31 2014 17:03:26 %S A100664 1,1,2,6,16,50,177,664,2532,9785 %N A100664 Number of inequivalent ways to dissect a square into n rectangles of equal perimeter. %C A100664 Dissections differing only by rotations and/or reflections are not counted as distinct. - _N. J. A. Sloane_, Dec 06 2012 %H A100664 Johan Nilsson, <a href="/A100664/a100664.pdf">Illustrations of terms up to a(6).</a> %e A100664 There are six ways to dissect a square into four rectangles of equal perimeter, so a(4)=6. %Y A100664 Cf. A108066. %K A100664 hard,more,nonn %O A100664 1,3 %A A100664 _Herman Beeksma_ and Hans Riesebos (hans.riesebos(AT)wanadoo.nl), Aug 04 2005