|
Search: id:A115725
|
|
|
| A115725 |
|
Number of partitions with maximum rectangle <= n. |
|
+0
3
|
|
| 1, 2, 5, 10, 26, 42, 118, 171, 389, 692, 1442, 1854, 5534, 6895, 11910, 21116, 44278, 52568, 118734, 138670, 300326, 492507, 728514, 829244, 2167430, 2987124, 4167602, 6092588, 11308432, 12554900, 29925267, 33023589
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A partition has maximum rectangle <= n iff it is a subpartition of row n of A010766.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Ferrers Diagram.
|
|
FORMULA
|
a(n) = subpart([<floor(n/k)]). The subpart function is A115728 (or A115729), [<floor(n/k)>] is row n of A010766
|
|
EXAMPLE
|
The 10 partitions with maximum rectangle <= 3: 0: []; 1: [1]; 2: [2], [1^2], [2,1]; 3: [3], [1^3], [3,1], [2,1^2], [3,1^2].
|
|
CROSSREFS
|
Cf. A115728, A115729, A115724, A010766.
Sequence in context: A018356 A026383 A002094 this_sequence A079572 A053391 A032099
Adjacent sequences: A115722 A115723 A115724 this_sequence A115726 A115727 A115728
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 11 2006
|
|
|
Search completed in 0.002 seconds
|
