|
Search: id:A115721
|
|
|
| A115721 |
|
Table of Durfee square of partitions in Abramowitz and Stegun order. |
|
+0
5
|
|
| 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,10
|
|
|
LINKS
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
Eric Weisstein's World of Mathematics, Durfee Square.
|
|
FORMULA
|
If partition is laid out in descending order p(1),p(2),...,p(k) without repetition factors (e.g. [3,2,2,1,1,1]), a(P) = max_k min(k,p(k)).
|
|
EXAMPLE
|
First few rows: 0; 1,1; 1,1,1; 1,1,2,1,1; 1,1,2,1,2,1,1
|
|
CROSSREFS
|
Cf. A115722, A115994, A115720, A036036.
Row lengths A000041, totals A115995.
Sequence in context: A143223 A063993 A115722 this_sequence A138330 A128591 A102005
Adjacent sequences: A115718 A115719 A115720 this_sequence A115722 A115723 A115724
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 11 2006
|
|
|
Search completed in 0.002 seconds
|
