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 A110356 #4 Mar 30 2012 16:50:19 %S A110356 1,4,4,6,1,6,5,6,6,5 %N A110356 Array read by antidiagonals: T(n,k) (n>=3, k>=3) = minimal number of polygonal pieces in a dissection of a regular n-gon to a regular k-gon (conjectured). %C A110356 I do not know which of these values have been proved to be minimal. %C A110356 Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets. %C A110356 See A110312 for further references and illustrations. %D A110356 G. N. Frederickson, Dissections: Plane and Fancy, Cambridge, 1997. %e A110356 Array begins: %e A110356 1 4 6 5 8 7 ... <= A110000 %e A110356 4 1 6 5 7 5 9 ... <= A110312 %e A110356 6 6 1 7 ... %e A110356 5 5 7 1 ... %e A110356 8 7 ... %e A110356 ... %Y A110356 Row 3 gives A110000, row 4 gives A110312. %K A110356 nonn,tabl %O A110356 3,2 %A A110356 _N. J. A. Sloane_, Sep 11 2005