cp's OEIS Frontend

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.

A238741 Number of strokes needed to draw all Young diagrams with n cells.

Original entry on oeis.org

0, 1, 2, 5, 12, 21, 40, 63, 105, 159, 245, 355, 526, 739, 1052, 1452, 2011, 2718, 3691, 4909, 6546
Offset: 0

Views

Author

Robin Chapman, Mar 04 2014

Keywords

Comments

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).