|
| |
|
|
A238741
|
|
Number of strokes needed to draw all Young diagrams with n cells.
|
|
1
|
|
|
|
0, 1, 2, 5, 12, 21, 40, 63, 105, 159, 245, 355, 526, 739, 1052, 1452, 2011, 2718, 3691, 4909, 6546
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
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).
|
|
|
LINKS
|
Richard P. Stanley, Problem 11762, The American Mathematical Monthly, 121 (2014), 266.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
