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 A238741 #14 Mar 14 2014 13:45:54 %S A238741 0,1,2,5,12,21,40,63,105,159,245,355,526,739,1052,1452,2011,2718,3691, %T A238741 4909,6546 %N A238741 Number of strokes needed to draw all Young diagrams with n cells. %C A238741 a(n) is the number of strokes needed to draw the Young diagrams (considered as an array of boxes) of all the partitions of n. (The generating function is omitted for the present, as finding it is a current Monthly problem). %H A238741 Richard P. Stanley, <a href="http://www.jstor.org/stable/10.4169/amer.math.monthly.121.03.266">Problem 11762</a>, The American Mathematical Monthly, 121 (2014), 266. %K A238741 easy,nonn %O A238741 0,3 %A A238741 _Robin Chapman_, Mar 04 2014